(Enter summary)
Abstract: The Curry-Howard correspondence between formulas and
types, proofs and programs, proof simplication and program
execution, also holds for intuitionistic modal logic S4. It turns
out that the S4 modalities translate as a monoidal comonad on
the space of proofs, giving rise to a canonical augmented simplicial
structure. We study the geometry of these augmented
simplicial sets, showing that each type gives rise to an augmented
simplicial set which is a disjoint sum of nerves of -
nite lattices... (Update)
Similar documents (at the sentence level):
27.1%: On the Geometry of Intuitionistic S4 Proofs - Goubault-Larrecq, Goubault (2002)
(Correct)
Active bibliography (related documents): More All
0.8: Some Geometric Perspectives In Concurrency Theory - Goubault (2003)
(Correct)
0.6: On Intuitionistic S4 and Augmented Simplicial Sets - Goubault-Larrecq, Goubault
(Correct)
0.4: Order-Theoretic, Geometric and Combinatorial Models of.. - Goubault-Larrecq.. (1999)
(Correct)
Similar documents based on text: More All
0.6: Joins for (Augmented) Simplicial Sets - Ehlers, Porter (1998)
(Correct)
0.5: About the Globular Homology of Higher Dimensional Automata - Gaucher (2000)
(Correct)
0.5: Simplicial Rapid Decay Algebras Associated To A Discrete Group - Ogle The Ohio
(Correct)
BibTeX entry: (Update)
@techreport{ goubaultlarrecq01geometry,
author = "J. {Goubault-Larrecq} and E. Goubault",
title = "On the Geometry of Intuitionistic {S4} Proofs",
number = "LSV-01-8",
address = "Cachan, France",
year = "2001",
url = "citeseer.ist.psu.edu/article/goubault-larrecq01geometry.html" }
Citations (may not include all citations):
562
Categories for the working mathematician (context) - Lane - 1971
359
Introduction to higher order categorical logic (context) - Lambek, Scott - 1986 ACM
233
The formulae-as-types notion of construction (context) - Howard - 1980
229
Foundations for programming languages (context) - Mitchell - 1985
215
Theoretical Computer Science (context) - Girard, logic - 1987 ACM
134
calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
121
Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud et al. - 1990
96
Simplicial objects in algebraic topology (context) - May - 1967
58
a proof-theoretical study (context) - Prawitz, deduction - 1965
52
Intuitionistic necessity revisited
- Bierman, de Paiva
51
Computational types from a logical perspective
- Benton, Bierman et al. - 1998 ACM DBLP
41
Equality between functionals (context) - Friedman
39
North-Holland Publishing Company (context) - Barendregt, calculus et al. - 1984
39
North-Holland Publishing Company (context) - Szabo, papers et al.
37
Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
30
programmer's manual (context) - Carthy, Abrahams et al. - 1962
27
Solving equations in abstract algebras: a rule-based survey .. (context) - Jouannaud, Kirchner - 1990
26
Syntactic closures
- Bawden, Rees ACM DBLP
17
Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
17
call-by-value and the -calculus (context) - Plotkin - 1975
14
A unication algorithm for typed -calculus (context) - erard, Huet - 1975
14
On computational interpretations of the modal logic S (context) - Goubault-Larrecq
14
Introduction to combinators and -calculus (context) - Hindley, Seldin - 1988
13
Algebraic topology and distributed computing|A primer
- Herlihy, Rajsbaum - 1995
12
Theoretical Computer Science (context) - Kobayashi, modality ACM
11
Handbook of Combinatorics (context) - Bj, Topological - 1995
10
North-Holland Mathematical Library (context) - Freyd, Scedrov et al. - 1990
9
Progress in Theoretical Computer Science (context) - Curien, combinators et al. - 1993
7
A modal lambda calculus with iteration and case constructs
- Leleu - 1997 ACM DBLP
7
Intuitionistic modal logic
- Wolter, Zakharyashev
6
Sequent combinators: A Hilbert system for the lambda calculu..
- Goguen, Goubault-Larrecq - 2000 ACM DBLP
5
A modal view of linear logic (context) - Martini, Masini - 1994 ACM DBLP
5
A characterization of lambda denability in categorical model.. (context) - Alimohamed - 1995
4
Technische Universitaet Muenchen (context) - of, Full et al. - 1997
3
Bangor Maths Preprint (context) - Ehlers, Porter et al.
3
The geometry of sequential computation I: A simplicial geome.. (context) - Basu - 1997
2
Available by anonymous ftp from host ftp (context) - Mitchell, Scedrov et al. - 1993
2
th Conference on Mathematical Foundations of Programming Sem.. (context) - Pfenning, Wong et al. - 1995
2
A formulas-as-types notion of control (context) - Grin - 1990
2
geometric and combinatorial models of intuitionistic S4 proo.. (context) - Goubault-Larrecq, Goubault - 1999
2
rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming.. (context) - Davies, Pfenning et al. - 1996
2
onstruction of modal logic, Invited talk, 1st Workshop on In.. (context) - Pfenning, Davies et al. - 1999
2
al proofs, Proof Theory of Modal Logic (context) - interpretation, mod - 1996
2
Applications of Categories in Computer Science (context) - Brookes, Geva et al. - 1991 ACM
1
Letter to the authors and Rajeev Gore (context) - Porter - 1999
1
Interner Bericht (context) - interpretations, modal et al.
1
Modal types as staging speci cations for run-time code gener.. (context) - Wickline, Lee et al. - 1998
Documents on the same site (http://www.di.ens.fr/~goubault/GOUBAULTpapers.html): More
Algebraic Topology And Concurrency - Fajstrup, Goubault, Raußen (1998)
(Correct)
Order-Theoretic, Geometric and Combinatorial Models of.. - Goubault-Larrecq.. (1999)
(Correct)
Topological Deformation of Higher Dimensional Automata - Gaucher, Goubault (2001)
(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