See this document in CiteSeerX!

Pattern Matching as Cut Elimination (1999)  (Make Corrections)  (7 citations)
Serenella Cerrito, Delia Kesner
Logic in Computer Science



  Home/Search   Context   Related

 
View or download:
lri.fr/LRI/articles/ke...pmasce.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lri.fr/~kesner/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the Curry-Howard Isomorphism, in the sense that types, both for patterns and terms, correspond to propositions, terms correspond to proofs, and term reduction corresponds to sequent proof normalization performed by cut... (Update)

Context of citations to this paper:   More

...although the non normal forms di er quite substantially. A nal example of this approach is in the very recent work of Cerrito and Kesner [11]. They develop a typed calculus in which the pattern matching of ML like languages is given meaning via rewrite rules which are...

...is not present in (standard) N systems. A final (hybrid) example of this approach is in the very recent work of Cerrito and Kesner (Cerrito and Kesner 1999). They develop a typed calculus in which the pattern matching of ML like languages is given meaning via rewrite rules...

Cited by:   More
CLL: A Concurrent Language Built from Logical Principles - Garg (2005)   (Correct)
Cut Rules and Explicit Substitutions - Vestergaard, Wells (1999)   (Correct)

Similar documents (at the sentence level):
33.6%:   Pattern Matching as Cut Elimination - Cerrito, Kesner (1999)   (Correct)
6.6%:   A Typed Pattern Calculus - Kesner, Puel, Tannen (1996)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Characterising Explicit Substitutions which Preserve Termination.. - Ritter (1999)   (Correct)
0.3:   Lectures on the Curry-Howard Isomorphism - Sørensen, Urzyczyn (1998)   (Correct)
0.2:   Strong Normalization of Explicit Substitutions via Cut.. - Di Cosmo, Kesner (1997)   (Correct)

Similar documents based on text:   More   All
0.3:   Pure Pattern Calculus - Jay, Kesner (2005)   (Correct)
0.2:   Strong Normalization with Singleton Types - Courant (2002)   (Correct)
0.2:   Reasoning about Layered, Wildcard and Product Patterns - Kesner (1994)   (Correct)

Related documents from co-citation:   More   All
7:   Computational interpretations of linear logic - Abramsky - 1993
6:   Preservation of Termination for Explicit Substitution (context) - Bloo - 1997
4:   Confluence and preservation of strong normalisation in an explicit substitutions.. - Munoz - 1996

BibTeX entry:   (Update)

S. Cerrito and D. Kesner. Pattern matching as cut elimination. Technical report ??, LRI, Universite Paris-Sud, France, 1999. http://citeseer.ist.psu.edu/article/cerrito99pattern.html   More

@inproceedings{ cerrito99pattern,
    author = "Serenella Cerrito and Delia Kesner",
    title = "Pattern Matching as Cut Elimination",
    booktitle = "Logic in Computer Science",
    pages = "98-108",
    year = "1999",
    url = "citeseer.ist.psu.edu/article/cerrito99pattern.html" }
Citations (may not include all citations):
1074   The definition of Standard ML (context) - Milner, Tofte et al. - 1990
788   Rewrite systems - Dershowitz, Jouannaud - 1990
258   Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
257   Report on the programming language haskell (context) - Hudak, Peyton-Jones et al. - 1992
233   Computational interpretations of linear logic - Abramsky - 1993
224   Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
214   Orderings for term rewriting systems (context) - Dershowitz - 1982
210   Its syntax and Semantics (context) - Barendregt, Calculus - 1984
143   A modal analysis of staged computation - Davies, Pfenning - 1996
95   Hope: An experimental applicative language - Burstall, MacQueen et al. - 1980
92   Explicit substitutions - Abadi, Cardelli et al. - 1991
73   a calculus of explicit substitutions which preserves strong .. (context) - Benaissa, Briaud et al. - 1996
30   Preservation of Termination for Explicit Substitution (context) - Bloo - 1997
26   Constructive logics part I: A tutorial on proof systems and .. - Gallier - 1993
23   Typed -calculi with explicit substitutions may not terminate (context) - Mellies - 1995
18   calculus structure isomorphic to sequent calculus structure (context) - Herbelin - 1994
17   Combinatory reduction systems with explicit substitution tha.. - Bloo, Rose - 1996
15   Strong normalization of explicit substitutions via cut elimi.. - Di Cosmo, Kesner - 1997
11   Explicit substitution: on the edge of strong normalization - Bloo, Geuvers
9   types et Mod eles (context) - Krivine - 1990
8   Confluence and preservation of strong normalisation in an ex.. - Munoz - 1996
7   Pattern matching as cut elimination - Cerrito, Kesner - 1999
6   Lecture Notes for the Summer School on Functional Programmin.. (context) - Lafont, linear - 1989
4   esultats de confluence pour les r egles fortes de la logique.. (context) - Hardin - 1987
4   A Typed Pattern Calculus - Kesner, Puel et al. - 1996
4   Abstract data type systems (context) - Jouannaud, Okada - 1997
4   Confluence of extensional and non-extensional lambda-calculi.. - Kesner
3   The cut rule and explicit substitutions - Vestergaard - 1998
3   Extension au second ordre du -calcul typ e avec motifs (context) - Courtieu - 1996
3   On computational interpretations of the modal logic S4: Cut .. (context) - Goubault-Larrecq - 1996
3   Une deduction naturelle explicite (context) - Pagano - 1998
3   Attempts for generalizing the RPO (context) - Kamin, Levy - 1980
3   A curry-howard isomorphism for sequent calculus (context) - Walder - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.lri.fr/~kesner/index.html):   More
Strong Normalization of Explicit Substitutions via Cut.. - Di Cosmo, Kesner (1997)   (Correct)
Rewriting with Extensional Polymorphic lambda-calculus - Di Cosmo, Kesner (1996)   (Correct)
Pattern Matching as Cut Elimination - Cerrito, Kesner (1999)   (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