Catarina Coquand  Home/Search
Context Related
Links: DBLP | cs.chalmers.se/~catarina/nf.ps.Z 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/~catarina/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is similar to the one in [2]. In this paper they define a normalization function for simply typed (Update)
Context of citations to this paper: More
...representing the long fij normal form of the Scheme value. Later, Coquand machine checked Berger and Schwichtenberg s algorithm [15] and Berger presented an alternative version by extracting it from a normalization proof [4] In his PhD thesis [25] Goldberg investigates...
...twenty years, little has been done in the area of machine assistance for metatheory. Investigations of the properties of # calculi [8, 27, 2] and typechecking Pure Type Systems [49] have been carried out, but the combination of these approaches into systems for performing...
Cited by: More
Formalising Strong Normalisation Proofs of Explicit.. - Kamareddine, Qiao (2002) (Correct)
Extracting a Proof of Coherence for Monoidal Categories - Dybjer (1995) (Correct)
Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer (1996) (Correct)
Similar documents (at the sentence level):
66.3%: From semantics to rules: A machine assisted analysis - Coquand (1994) (Correct)
Active bibliography (related documents): More All
0.5: Predicate Transformer Semantics of a Higher Order Imperative.. - Naumann (1998) (Correct)
0.3: Inductive Definitions with Decidable Atomic Formulas - Setzer (Correct)
0.3: Constructions, Inductive Types and Strong Normalization - Altenkirch (1993) (Correct)
Similar documents based on text: More All
0.0: A realizability interpretation of Martin-Löf's type theory - Coquand (Correct)
0.0: Combinator Shared Reduction and Infinite Objects in Type Theory - Coquand (1996) (Correct)
0.0: Synchronous Coordination in the µLog Coordination Model - De Bosschere, Jacquet (2001) (Correct)
Related documents from co-citation: More All
9: Intuitionistic model constructions and normalization proofs - Coquand, Dybjer - 1997
8: Intuitionistic Type Theory (context) - Martin-Lof - 1984
7: A user's guide to ALF - Altenkirch, Gaspes et al. - 1994
BibTeX entry: (Update)
Catarina Coquand. From Semantics to Rules: a Machine Assisted Analysis. In B#rger, Gurevich, and Meinke, editors, CSL'93, pages 91105. Springer-Verlag, LNCS 832, 1994. http://citeseer.ist.psu.edu/coquand99from.html More
@inproceedings{ coquand93from,
author = "Catarina Coquand",
title = "From Semantics to Rules: {A} Machine Assisted Analysis",
booktitle = "Proceedings of the 7th Workshop on Computer Science Logic",
publisher = "Springer-Verlag LNCS 832",
editor = "E. B{\"o}rger and Y. Gurevich and K. Meinke",
pages = "91--105",
year = "1993",
url = "citeseer.ist.psu.edu/coquand99from.html" }
Citations (may not include all citations):79 Pattern Matching with Dependent Types (context) - Coquand - 1992
71 An Intuitionistic Theory of Types: Predicative Part (context) - Martin-Lof - 1975
67 Inheritance as implicit coercion (context) - Breazu-Tannen, Coquand et al. - 1991
43 An inverse of the evaluation functional for typed -calculus (context) - Berger, Schwichtenberg
42 Program extraction from normalization proofs (context) - Berger ACM DBLP
41 Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1991 DBLP
33 Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer - 1997 DBLP
30 Relating theories of the lambda-calculus (context) - Scott - 1980
30 Information and Control (context) - Statman, the et al. - 1985
23 The new implementation of ALF (context) - Magnusson - 1992
21 Programming in MartinL of's Type Theory (context) - Nordstrom, Petersson et al. - 1990
17 Formulation of Martin-Lof's theory of types with explicit su.. (context) - Tasistro - 1993
14 A proof of strong normalization for the theory of constructi.. - Coquand, Gallier
12 Semantics of Type Theory (context) - Streicher - 1991 ACM
10 Categorical abstract machine for higher-order typed - calcul.. (context) - Ritter - 1992
5 ACM Conference on Principles of Programming Languages (context) - Abadi, Cardelli et al. - 1990
3 Substitution calculus (context) - Martin-Lof - 1992
3 the Axiom of Extensionality - Part (context) - Gandy - 1956
2 Semantical analysis of specification logic (context) - Tennant - 1985
2 Crossley and M (context) - Semantical, intutionistic et al. - 1965
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.chalmers.se/~catarina/):
A realizability interpretation of Martin-Löf's type theory - Coquand (Correct)
Combinator Shared Reduction and Infinite Objects in Type Theory - Coquand (1996) (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