Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

LICS
1989
IEEE

favoriteEmaildiscussreport

141views Automated Reasoning» more LICS 1989»

Computational Lambda-Calculus and Monads

13 years 9 months ago

Computational Lambda-Calculus and Monads

Download www.disi.unige.it

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 gross simpliﬁcation1 is introduced. We give a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any speciﬁc computational model.

Eugenio Moggi

Real-time Traffic

Automated Reasoning | Gross Simpliﬁcation1 | LICS 1989 | Speciﬁc Computational Model | Useful Mathematical Tool |

claim paper

Related Content

» Linearly Used Effects Monadic and CPS Transformations into the Linear Lambda Calculus

» On Completeness of Logical Relations for Monadic Types

» Monads Need Not Be Endofunctors

» Comonadic Notions of Computation

» Simulation in the CallbyNeed LambdaCalculus with letrec

» Stochastic lambda calculus and monads of probability distributions

» Translating dependency into parametricity

» Sequent combinators a Hilbert system for the lambda calculus

» Introduction to Functional Programming

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1989
Where	LICS
Authors	Eugenio Moggi

Comments (0)