programs Reinhard Kahle Thomas Studer March 15, 2001  Home/Search
Context
Related
| iam.unibe.ch/~til/publica...nonterm.pdf 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: iam.unibe.ch/~til/publications... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In applicative theories the recursion theorem provides a term rec which solves recursive equations. However, it is not provable that a solution obtained by rec is minimal. In the present paper we introduce an applicative theory in which it is possible to define a least fixed point operator. Still, our theory has a standard recursion theoretic interpretation. (Update)
Similar documents (at the sentence level):
46.2%: Object-Oriented Programming in Explicit Mathematics: Towards .. - von Werthenstein (2001) (Correct)
34.1%: Formalizing Non-Termination of Recursive Programs - Kahle, Studer (2001) (Correct)
7.5%: Constructive Foundations for Featherweight Java - Studer (2001) (Correct)
Active bibliography (related documents): More All
0.8: Impredicative Overloading in Explicit Mathematics - Studer (2000) (Correct)
0.6: A Theory of Explicit Mathematics Equivalent to ID 1 - Kahle, Studer (2000) (Correct)
0.3: Embedding Hardware Description Languages in Proof Systems - Goossens (1992) (Correct)
Similar documents based on text: More All
0.4: Universes in Explicit Mathematics - Jäger, Kahle, Studer (1999) (Correct)
0.3: Natural Numbers and Forms of Weak Induction in Applicative Theories - Kahle (1995) (Correct)
0.3: Truth in Applicative Theories - Kahle (2001) (Correct)
BibTeX entry: (Update)
@misc{ kahle-formalizing,
author = "Programs Reinhard Kahle",
title = "Formalizing Non-Termination of Recursive",
url = "citeseer.ist.psu.edu/615184.html" }
Citations (may not include all citations):229 Foundations for Programming Languages (context) - Mitchell - 1996
137 Introduction to Combinators and #-calculus (context) - Hindley, Seldin - 1986
133 Mathematical Theory of Computation (context) - Manna - 1974
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
95 Elements of Functional Programming (context) - Reade - 1989
69 A language and axioms for explicit mathematics (context) - Feferman - 1975
63 Constructive theories of functions and classes (context) - Feferman - 1979
51 Allyn and Bacon (context) - Schmidt - 1986
50 Domains and LambdaCalculi (context) - Amadio, Curien - 1998
49 Systems of explicit mathematics with non-constructive -opera.. - Feferman, Jager - 1993
46 revised edition (context) - Barendregt, Calculus - 1984
43 Logics for termination and correctness of functional program.. (context) - Feferman - 1992
43 Logics for termination and correctness of functional program.. (context) - Feferman - 1991
34 Foundations of Constructive Mathematics: Metamathematical St.. (context) - Beeson - 1985
27 Polymorphic typed lambda-calculi in a type-free axiomatic fr.. (context) - Feferman - 1990
22 Constructive Foundations for Functional Languages (context) - Turner - 1991
19 A type-theoretical alternative to ISWIM (context) - Scott - 1969
15 Reference Manual for the LAMBDA System (context) - Francis, Finn et al. - 1990
11 Logics of partial terms for strict and non-strict functional.. (context) - Stark, constant - 1998
9 Applikative Theorien und Frege-Strukturen (context) - Kahle - 1997
9 call-by-name and the logic of values (context) - Stark - 1997
8 Logic Manual for the LAMBDA System (context) - Finn, Fourman - 1990
7 volume 1407 of Lecture Notes in Mathematics (context) - Pohlers - 1989
6 and Thomas Strahm (context) - Jager, Kahle - 1999
5 Impredicative overloading in explicit mathematics - Studer
5 Weak theories of operations and types (context) - Turner - 1996
5 str : a calculus with overloading and late-binding (context) - Studer, for
5 Einbettung des Beweissystems Lambda in eine Theorie von Oper.. (context) - Kahle - 1992
4 Institut fur Informatik und angewandte Mathematik (context) - Studer, of et al. - 2001
4 Computability and Complexity (context) - Jones - 1997
4 Constructive foundations for Featherweight Java - Studer
3 A new approach to abstract data types II: computation on ADT.. (context) - Feferman - 1992
3 and Jonathan Seldin (context) - Curry, Hindley - 1972
3 A theory of explicit mathematics equivalent to ID - Kahle, Studer - 2000
3 strictness in applicative theories (context) - Kahle - 2000
2 Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
Documents on the same site (http://www.iam.unibe.ch/~til/publications/): More
Systems of explicit mathematics with non-constructive.. - Feferman, Jäger (1993) (Correct)
Relations Between Propositional Normal Modal Logics: An Overview - Goré, al. (1995) (Correct)
LWBtheory: information about some propositional logics via the WWW - Heuerding (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