Computational Types from a Logical Perspective I

Computational Types from a Logical Perspective I (1995)

Cached

Download Links

by P.N. Benton , G.M. Bierman , V.C.V. de Paiva

Citations:

51 - 6 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Computational Types from a Logical Perspective I	user correction - Legacy Corrections
AUTHOR NAME	P.N. Benton	user correction - Legacy Corrections
AUTHOR NAME	G.M. Bierman	user correction - Legacy Corrections
AUTHOR AFFIL	; y; z; Computer Laboratory; University of Cambridge; U.K.	user correction - Legacy Corrections
AUTHOR ADDR	; V.C.V. de Paiva; Cambridge CB2 3QG	user correction - Legacy Corrections
AUTHOR NAME	V.C.V. de Paiva	user correction - Legacy Corrections
ABSTRACT	Moggi's computational lambda calculus is a metalanguage for denotational semantics which arose from the observation that many different notions of computation have the categorical structure of a strong monad on a cartesian closed category. In this paper we show that the computational lambda calculus also arises naturally as the term calculus corresponding (by the Curry-Howard correspondence) to a novel intuitionistic modal propositional logic. We give natural deduction, sequent calculus and Hilbert-style presentations of this logic and prove a strong normalisation result. 1 Introduction The computational lambda calculus was introduced by Moggi as a metalanguage for denotational semantics which more faithfully models real programming language features such as non-termination, differing evaluation strategies, non-determinism and side-effects than does the ordinary simply typed lambda calculus [17, 18]. The starting point for Moggi's work is an explicit semantic distinction between compu...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	25 found	ParsCit 1.0