Calculus in Coq Adam Koprowski Eindhoven University of Technology Department...  Home/Search
Context
Related
| win.tue.nl/~akoprows/coqhorp...stlc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: win.tue.nl/~akopro...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present a formalization of the simply typed lambda calculus with constants and with typing a la Church. It has been accomplished using the theorem prover Coq. The formalization includes, among other results, definitions of typed terms over arbitrary many-sorted signature, a substitution operating on typing judgements, an equivalence relation generalizing the concept of #-convertibility to free variables and a proof of strong normalization of #-reduction. The... (Update)
Active bibliography (related documents): More All
0.3: A lambda-to-CL Translation for Strong Normalization - Akama (1997) (Correct)
0.3: Syntax and Semantics of Dependent Types - Hofmann (1997) (Correct)
0.2: Memoization in Type-Directed Partial Evaluation - Balat, Danvy (2002) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ coq-formalization,
author = "Calculus In Coq",
title = "A Formalization of the Simply Typed Lambda",
url = "citeseer.ist.psu.edu/742197.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940
66 Handbook of logic in computer science (context) - Barendregt, with - 1992
42 Program extraction from normalization proofs (context) - Berger, Berghofer et al. - 2005
35 Lambda-calculus notation with nameless dummies: a tool for a.. (context) - de Bruijn - 1972
29 The higher-order recursive path ordering - Jouannaud, Rubio - 1999
22 The Coq Development Team. The Coq Proof Assistant Reference .. (context) - Development, Coq et al.
21 A formalization of the strong normalization proof for system.. - Altenkirch - 1993
10 Auto-validation d'un systeme de preuves avec familles induct.. (context) - Barras - 1999
4 Normalization by evaluation for typed lambda calculus with c.. - Altenkirch, Dybjer et al. - 2001
3 Proving strong normalization of cc by modifying realizabilit.. - Altenkirch - 1993
2 Certified higher-order recursive path ordering (context) - Koprowski - 2006
2 Certified higher-order recursive path ordering (context) - Koprowski
1 Polymorphic higher-order recursive path orderings (context) - Jouannaud, Rubio - 2005
1 Program extraction from proofs of weak head normalization (context) - Stoevring, Danvy et al.
http://color.loria.fr
Documents on the same site (http://www.win.tue.nl/~akoprows/publications.html): More
Well-Foundedness of the Recursive Path Ordering in Coq - de Kleijn, Koprowski, van.. (2004) (Correct)
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (Correct)
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (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