Sciweavers

4757 search results - page 16 / 952
» Monads for Functional Programming
Sort
View
APLAS
2007
ACM
13 years 11 months ago
Monadic, Prompt Lazy Assertions in Haskell
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
Olaf Chitil, Frank Huch
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 11 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
ICALP
2010
Springer
14 years 10 days ago
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
LICS
1989
IEEE
13 years 11 months ago
Computational Lambda-Calculus and Monads
The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gros...
Eugenio Moggi