See this document in CiteSeerX!

A Machine Checked Proof that Ackermann's Function is not Primitive Recursive (1991)  (Make Corrections)  (8 citations)
Nora Szasz Department of Computer Sciences Chalmers University of Technology...



  Home/Search   Context   Related

Links:   ACM

 
View or download:
cs.chalmers.se/pub/users...ackermann.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  math.jussieu.fr....cs.chalmers.se (more)
(Enter author homepages)

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

Abstract: Specification Approach As is common in programming, it is possible in ALF to work with abstract sets and operations rather than with their actual inductive and recursive definitions. Thus, we may specify abstract structures and operations, which consist of a collection of propositions implicitly characterizing a number of sets and operations on them (such a specification is usually given by a set of equations). When writing the proof, we used this approach in order to work in a modular style,... (Update)

Context of citations to this paper:   More

...section 4 we make some comments about the development of the proof and design decisions. The completely formalized proof can be found in [Sza91]. 2 Primitive Recursive Functions, t Primitive Recursive Functions and Ackermann s Result In the first part of this section, we will...

...an externally given general recursive program. Hedberg has implemented his examples using Paulson s Isabelle system [31] Nora Szasz [36] has formalized the proof that Ackermann s function is not primitive recursive. The basic definition is a binary inductive family of...

Cited by:   More
A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions - Paulson (1997)   (Correct)
Experiences with a mechanisation of Martin-Löf's Theory of.. - Betarte, Giménez (1992)   (Correct)
Inductive Families - Dybjer (1997)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Induce-Statements and Induce-Expressions: Constructs for.. - Norvell (1993)   (Correct)
0.1:   A case study in machine-assisted proofs: The Integers form an.. - Betarte (1993)   (Correct)
0.1:   Martin-Löf's Type Theory - Nordström, Petersson, Smith   (Correct)

Similar documents based on text:   More   All
0.1:   Ackermann and the Superpowers - Porto, Matos (1995)   (Correct)
0.1:   Ackermann Function, or What's So Special about 1969? - Froemke, Grossman   (Correct)
0.1:   A user's guide to ALF - Altenkirch, Gaspes, Nordström, von.. (1994)   (Correct)

Related documents from co-citation:   More   All
5:   Inductive sets and families in Martin-Lof's type theory and their settheoretic s.. - Dybjer - 1991
4:   Programming in Martin-Lof's Type Theory (context) - Smith, Nordstrom et al. - 1990
4:   A short description of another logical framework (context) - Augustsson, Coquand et al. - 1990

BibTeX entry:   (Update)

Nora Szasz. A Machine Checked Proof that Ackermann's Function is not Primitive Recursive. Licentiate Thesis, Chalmers University of Technology and University of G#teborg, Sweden, June 1991. Also in G. Huet and G. Plotkin, editors, Logical Frameworks, Cambridge University Press. http://citeseer.ist.psu.edu/szasz91machine.html   More

@mastersthesis{ szasz91machine,
    author = "Nora Szasz",
    title = "A Machine Checked Proof that {Ackermann's} Function is not Primitive Recursive",
    address = "Sweden",
    year = "1991",
    url = "citeseer.ist.psu.edu/szasz91machine.html" }
Citations (may not include all citations):
236   Intuitionistic Type Theory (context) - Martin-Lof - 1984
109   Programming in Martin-Lof's Type Theory (context) - Nordstrom, Petersson et al. - 1990
73   Inductively defined types (context) - Coquand, Paulin - 1990  ACM   DBLP
41   Inductive sets and families in Martin-Lof's type theory and .. - Dybjer - 1990
29   A short description of Another Logical Framework (context) - Augustsson, Coquand et al. - 1990
23   Zum Hilbertschen Aufbau der reellen Zahlen (context) - Ackermann - 1928
8   A Machine Checked Proof that Ackermann's Function is not Pri.. - Szasz - 1991  ACM
2   Konstruktion nichtrekursiver Funktionen (context) - P'eter - 1935



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


Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.chalmers.se.html):   More
From Gamma to CBS: Refining multiset transformations with.. - Sands, Weichert (1997)   (Correct)
Reflections on Reflections - Barthe, Hatcliff, Sørensen (1997)   (Correct)
A Parallel Functional Database on GRIP - Akerholt, Hammond, Jones, Trinder (1992)   (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