liboleg-2010.1.10.0: An evolving collection of Oleg Kiselyov's Haskell modules

Lambda.Dynamics

Description

Philippe de Groote. 2010. Dynamic logic: a type-theoretic view. Talk slides at `Le modle et lalgorithme, Rocquencourt. http://www.inria.fr/rocquencourt/rendez-vous/modele-et-algo/dynamic-logic-a-type-theoretic-view

Synopsis

Documentation

type State = [Entity]Source

We extend the Lambda language with state (of the type State)

class Lambda lrepr => States lrepr whereSource

Methods

update :: lrepr Entity -> lrepr State -> lrepr StateSource

select :: lrepr State -> lrepr EntitySource

Instances

States C 
States R

We correspondingly extend our R, C, P intrepreters of Lambda

States lrepr => States (P lrepr) 

type family Dynamic a Source

data D c a Source

Constructors

D 

Fields

unD :: c (Dynamic a)
 

Instances

States c => Lambda (D c) 
States lrepr => Dynamics (D lrepr) 
Show (Sem (D (P C)) S) 
Show (Sem (D C) S) 
Show (D (P C) Bool) 
Show (D C Bool) 

class Predicate a whereSource

Methods

dynamic :: Lambda lrepr => (lrepr State -> lrepr a) -> lrepr (Dynamic a)Source

static :: Lambda lrepr => lrepr (Dynamic a) -> lrepr State -> lrepr aSource

Instances

class Lambda lrepr => Dynamics lrepr whereSource

Methods

it' :: lrepr ((Entity -> Bool) -> Bool)Source

Instances

Dynamics C 
Dynamics lrepr => Dynamics (P lrepr) 
States lrepr => Dynamics (D lrepr) 

class Quantifier repr => Pronoun repr whereSource

Methods

it_ :: repr QNPSource

Instances

Pronoun EN 
Dynamics lrepr => Pronoun (Sem lrepr)