DMCA
Computational Types from a Logical Perspective I (1995)
Cached
Download Links
| Citations: | 59 - 6 self |
BibTeX
@MISC{Benton95computationaltypes,
author = {P.N. Benton and G.M. Bierman and V.C.V. de Paiva},
title = {Computational Types from a Logical Perspective I},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
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...
Keyphrases
computational lambda calculus logical perspective computational type denotational semantics model real programming language feature term calculus hilbert-style presentation evaluation strategy novel intuitionistic modal propositional logic strong normalisation result lambda calculus explicit semantic distinction many different notion curry-howard correspondence sequent calculus strong monad categorical structure natural deduction
