Sciweavers

233 search results - page 12 / 47
» Computational Lambda-Calculus and Monads
Sort
View
KBSE
1997
IEEE
13 years 11 months ago
Moving Proofs-As-Programs into Practice
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...
James L. Caldwell
FLAIRS
2006
13 years 8 months ago
Multi-Dimensional Dependency Grammar as Multigraph Description
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...
Ralph Debusmann, Gert Smolka
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
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...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
TCS
2010
13 years 2 months ago
Monad transformers as monoid transformers
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...
Mauro Jaskelioff, Eugenio Moggi
FOSSACS
2011
Springer
12 years 11 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs