(Enter summary)
Abstract: These notes are extracted from the rst version of the paper iFrom
Computation to Foundations: the -calculus and its webbed modelsj.
They nearly disappeared in the revised version of that paper, and we
make them available separately.
0.1 -calculus as a foundation for Programming Theory.
-calculus came back to the front of the scene in the sixties with the development
of Computer Science, under the impulse of Landin [21] and Backus (cf. [1]) and
generated the family of functional languages... (Update)
Context of citations to this paper: More
.... its philosophical interest, intuitionistic logic proved to be extremely useful in computer science (illustrated by the Curry Howard correspondence [2]) We define the modal logic IS4 as an extension of the propositional intuitionistic logic, to which a modal operator # (usually...
Cited by: More
A Model for Knowledge Representation in Distributed Systems - Brunet (2002)
(Correct)
Active bibliography (related documents): More All
1.1: Building continuous webbed models for System F - Berardi, Berline (1998)
(Correct)
0.4: A New Deconstructive Logic: Linear Logic - Danos, Joinet, Schellinx (1997)
(Correct)
0.3: Behavioral Equivalence in the Polymorphic Pi-Calculus - Pierce, Sangiorgi (1997)
(Correct)
Similar documents based on text: More All
0.3: About Classical Logic and Imperative Programming - Krivine (1996)
(Correct)
0.2: βη-complete models for System F - Berardi, Berline (2000)
(Correct)
0.2: A kappa-denotational semantics for Map Theory in ZFC + SI - Berline, Grue (1997)
(Correct)
BibTeX entry: (Update)
Chantal Berline. A presentation of the curry-howard correspondance, 1997. http://citeseer.ist.psu.edu/berline97presentation.html More
@misc{ berline97presentation,
author = "C. Berline",
title = "A presentation of the curry-howard correspondance",
text = "Chantal Berline. A presentation of the curry-howard correspondance, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/berline97presentation.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard, system et al. - 1986
273
Can programming be liberated from the von Neumann style (context) - Backus - 1978
218
The mechanical evaluation of expressions (context) - Landin - 1964
134
calculus : an algorithmic interpretation of classical natura.. (context) - Parigot - 1992
110
A formulae-as-type notion of control
- Griffin - 1990
75
A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
60
Extracting Constructive contents from classical proofs (context) - Murthy - 1990
32
Classical proofs as programs (context) - Parigot - 1993
29
Lambda-calcul (context) - Krivine - 1990
27
Functionality in Combinatory Logic (context) - Curry - 1934
24
Recursive programming with proofs (context) - Parigot - 1992
22
Die formalen Regeln der intuitionistischen Logic (context) - Heyting - 1930
22
The expressiveness of simple and second order type structure.. (context) - Fortune, Leivant et al. - 1983
20
Programming with proofs (context) - Krivine, Parigot - 1990
17
Reasoning about functional programs and complexity classes a.. (context) - Leivant - 1983
10
and pseudo-classical type systems : A translation at work (context) - Murthy, operators - 1992
7
Cambridge tracts in Computer Science (context) - Girard, Lafont et al. - 1989
7
Computational content of classical logic
- Coquand - 1997
6
Colloque sur la programmation (context) - Reynolds, of et al. - 1974
6
the representations of data in lambda-calculus (context) - Parigot - 1989
5
storage operators and second-order lambdacalculus (context) - Krivine, logic - 1994
4
Une extension de l'interpr#tation de G#del # l'analyse (context) - Girard - 1971
3
augmented english translation of the above (context) - Krivine, types et al. - 1993
3
limination des coupures de l'Arithm#tique d'ordre sup#rieure (context) - Girard, tation - 1972
1
Ergebnisse der Mathematik und ihre Grenzgebiete (context) - Heyting, Grundlagenforschung et al. - 1934
1
Une preuve formelle et intuitioniste du th#or#me de compl #t.. (context) - Krivine - 1997
1
About classical logic and imperative programming
- Krivine - 1996
1
The impact of the -calculus in logic and computer science (context) - Barendregt
1
tique fonctionnelle avec points xes (context) - Raffali - 1994
Documents on the same site (http://www.logique.jussieu.fr/www.berline/index.html): More
βη-complete models for system F - Berardi, Berline (1999)
(Correct)
Building continuous webbed models for System F - Berardi, Berline (1998)
(Correct)
A kappa-denotational semantics for Map Theory in ZFC + SI - Berline, Grue (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC