Thierry Coquand, Peter Dybjer  Home/Search
Context Related
Links: DBLP | cs.chalmers.se/pub...ueingTypes93.ps.gz 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: cs.chalmers.se/~peterd/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate semantical normalization proofs for typed combinatory logic and weak -calculus. One builds a model and a function `quote' which inverts the interpretation function. A normalization function is then obtained by composing quote with the interpretation function. Our models are just like the intended model, except that the function space includes a syntactic component as well as a semantic one. We call this a `glued' model because of its similarity with the glueing construction in... (Update)
Cited by: More
An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
From Reduction-Based to Reduction-Free Normalization - Danvy (2004) (Correct)
A Denotational Account of Untyped Normalization by Evaluation - Filinski, Rohde (2003) (Correct)
Active bibliography (related documents): More All
0.8: Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer (1996) (Correct)
0.5: Martin-Löf's Type Theory - Nordström, Petersson, Smith (Correct)
0.5: Implementing a Category of Sets in ALF - Gaspes (1994) (Correct)
Similar documents based on text: More All
0.3: On Equivalence and Canonical Forms in the LF Type Theory.. - Harper, Pfenning (1999) (Correct)
0.2: Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (Correct)
0.2: Reduction-free normalisation for system F - Altenkirch, Hofmann, Streicher (1996) (Correct)
Related documents from co-citation: More All
19: Categorical reconstruction of a reduction free normalization proof - Altenkirch, Hofmann et al. - 1995
17: Type-directed partial evaluation - Danvy
16: An inverse of the evaluation functional for typed -calculus (context) - Berger, Schwichtenberg - 1991
BibTeX entry: (Update)
Thierry Coquand and Peter Dybjer. Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science, 7:73--94, 1997. http://citeseer.ist.psu.edu/article/coquand98intuitionistic.html More
@article{ coquand97intuitionistic,
author = "Thierry Coquand and Peter Dybjer",
title = "Intuitionistic Model Constructions and Normalization Proofs",
journal = "Mathematical Structures in Computer Science",
volume = "7",
number = "1",
pages = "75-94",
year = "1997",
url = "citeseer.ist.psu.edu/article/coquand98intuitionistic.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986 ACM
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
218 The mechanical evaluation of expressions (context) - Landin - 1964
92 Explicit substitutions - Abadi, Cardelli et al. - 1990 ACM DBLP
79 Pattern matching with dependent types (context) - Coquand - 1992
73 Inductively defined types (context) - Coquand, Paulin - 1990
71 An intuitionistic theory of types: Predicative part (context) - Martin-Lof - 1975
68 Confluence properties of weak and strong calculi of explicit.. - Curien, Hardin et al. - 1991
65 Sequential Algorithms and Functional Programming (context) - Curien - 1986
62 Programming in Martin-Lof 's Type Theory: an Introduction (context) - Nordstrom, Petersson et al. - 1990
42 Program extraction from normalization proofs (context) - Berger - 1993 ACM DBLP
41 Inductive sets and families in Martin-Lof's type theory and .. - Dybjer - 1991
35 Formal Aspects of Computing (context) - Dybjer
33 More on advice on structuring compilers and proving them cor.. (context) - Thatcher, Wagner et al. - 1981 ACM DBLP
28 Notes on sconing and relators - Mitchell, Scedrov - 1992 ACM DBLP
23 Der wahrheitsbegriff in den formalisierten sprachen (context) - Tarski - 1936
22 An intuitionistic theory of types (context) - Martin-Lof - 1972
18 About models for intuitionistic type theories and the notion.. (context) - Martin-Lof - 1975
14 Efficient self-interpretation in lambda calculus (context) - AE - 1992
8 An inverse to the evaluation functional for typed -calculus (context) - Berger, Schwichtenberg - 1991
8 Extraction of redundancy-free programs from constructive nat.. (context) - Takayama
7 Residual theory in -calculus: a complete Gallina development (context) - Huet - 1993
6 Implantation de Langages de Programmation guidee par la Logi.. (context) - Lafont, Categories - 1988
5 Metacircularity in the polymorphic lambda-calculus (context) - Pfenning, Lee - 1991 DBLP
2 Machine checked normalization proofs for typed combinator ca.. (context) - Gaspes, Smith - 1992
2 Analysis of simply typed lambda-calculus in ALF (context) - Coquand - 1993
1 A formalisation of the strong normalization proof for System.. (context) - Altenkirch - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.chalmers.se/~peterd/): More
Final Report - Febr Ua Ry (Correct)
A Finite Axiomatization of Inductive-Recursive Definitions - Dybjer, Setzer (1998) (Correct)
Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (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