3 search results - page 1 / 1 » Recursive Program Schemes and Context-Free Monads |
94
Voted
ENTCS
2010
14 years 10 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
90
Voted
ICFP
2005
ACM
15 years 10 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
126
click to vote
SCP
2011
14 years 5 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...