See this document in CiteSeerX!

Systems for Open Terms: An Overview (2001)  (Make Corrections)  
G. I. Jojgov



  Home/Search   Context   Related

 
View or download:
win.tue.nl/~gjojgov/overview.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  win.tue.nl/~gjojgov/ (more)
(Enter author homepages)

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

Abstract: In this paper we make an overview of some existing systems of open (incomplete) terms including ALF, Typelab, OLEG, L , Automath, c and s e . (Update)

Active bibliography (related documents):   More   All
0.5:   Relating the lambda sigma- and lambda s-Styles of.. - Kamareddine, Ríos (2000)   (Correct)
0.5:   The Suspension Notation for Lambda Terms and its Use in.. - Nadathur (2003)   (Correct)
0.5:   A Calculus of Lambda Calculus Contexts - Bognar, de Vrijer (2001)   (Correct)

Similar documents based on text:   More   All
0.2:   Pairs of Structure Degrees - Jojgov (1998)   (Correct)
0.2:   Holes with Binding Power - Jojgov   (Correct)
0.2:   Open Proofs and Open Terms: A Basis for Interactive Logic.. - And Gueorgui Jojgov   (Correct)

BibTeX entry:   (Update)

@misc{ jojgov-systems,
  author = "G. I. Jojgov",
  title = "Systems for Open Terms: An Overview",
  url = "citeseer.ist.psu.edu/jojgov01systems.html" }
Citations (may not include all citations):
382   Lambda calculi with types - Barendregt - 1992
137   Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
106   Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
95   An Extended Calculus of Constructions - Luo - 1990
68   Logics and Type systems - Geuvers - 1993
65   The Implementation of ALF - a Proof Editor based on Martin-L.. - Magnusson - 1995
46   The calculus of constructions (context) - Coquand, erard - 1988
35   a journey through calculi of explicit substitutions - Lescanne, to - 1994
26   calculus with explicit substitution which preserves strong n.. (context) - Kamareddine, os - 1997
21   A namefree lambda calculus with facilities for internal defi.. (context) - de Bruijn - 1978
21   calculus: Its typed and its extended versions (context) - Kamareddine, os - 1995
18   Dependently Typed Functional Programs and their Proofs - McBride - 1999
12   style of explicit substitution (context) - Kamareddine - 2000
6   Proof assistants using dependent type systems - Barendregt, Geuvers - 1999
5   Construction and Deduction in Type Theories (context) - Strecker - 1998
4   Interactive and automated proof construction in type theory (context) - Strecker, Luther et al. - 1998
3   a la de Bruijn with explicit substitutions (context) - Kamareddine, os et al. - 1995
2   Lambda calculus extended with segments (context) - Balsters - 1986
2   calculus does not preserve strong normalisation (context) - Guillaume - 2000
2   A Calculus of Substitutions for Incomplete-Proof Representat.. (context) - esar, noz - 1997
1   To appear in Mathematical Structures in Computer Science (context) - noz, types et al.
1   The ne-structure of lambda calculus (context) - Nederpelt - 1992
1   Preservation of Strong Normalization (context) - Bloo - 1995
http://www.cs.vu.nl/
http://www.dcs.ed.ac.uk/home/lego/index.html

Documents on the same site (http://www.win.tue.nl/~gjojgov/):   More
Pairs of Structure Degrees - Jojgov (1998)   (Correct)
On NP-Completeness and Methods for Proving It - Jojgov (1999)   (Correct)
The Axiom of Choice from the Viewpoint of Recursion Theory - Jojgov (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