233 search results - page 12 / 47 » Computational Lambda-Calculus and Monads |
151
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
187
click to vote
FLAIRS
2006
15 years 7 months ago
2006
Extensible Dependency Grammar (XDG) is new, modular grammar formalism for natural language. An XDG analysis is a multi-dimensional dependency graph, where each dimension represent...
142
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
182
click to vote
TCS
2010
15 years 21 days ago
2010
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...
178
click to vote
FOSSACS
2011
Springer
14 years 9 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...