Sciweavers

233 search results - page 17 / 47
» Computational Lambda-Calculus and Monads
Sort
View
ENTCS
2002
128views more  ENTCS 2002»
13 years 7 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
ENTCS
2011
134views more  ENTCS 2011»
12 years 11 months ago
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
Sam Lindley, Philip Wadler, Jeremy Yallop
AMAST
2004
Springer
14 years 27 days ago
Generic Exception Handling and the Java Monad
We develop an equational definition of exception monads that characterizes Moggi’s exception monad transformer. This axiomatization is then used to define an extension of previ...
Lutz Schröder, Till Mossakowski
APLAS
2006
ACM
14 years 1 months ago
Proof Abstraction for Imperative Languages
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
William L. Harrison
ESOP
2008
Springer
13 years 9 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong