Helmut Schwichtenberg  Home/Search
Context
Related
| mathematik.unimuenchen.de/~s...pe.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: mathematik.unimuenchen.de/~sc... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: p Preprint Series 72, University of Utrecht, Dept of Philosophy, January 1992. nitions, Proceedings of the Second Scandinavian Logic Symposium (J.E. Fenstad, ed.), North{ Holland, Amsterdam, 1971, pp. 179-216. 27. Dale Miller, A logic programming language with lambda{abstraction, function variables and simple uni 82 BIBLIOGRAPHY 16. Matthias Felleisen, Daniel P. Friedman, E. Kohlbecker, and B.F. Duba, A syntactic theory of sequential control, Theoretical Computer Science 52 (1987), ... (Update)
Active bibliography (related documents): More All
0.5: Normalization for Simultaneous Free Algebras - Benl, Berger, Schwichtenberg (2000) (Correct)
0.0: A Simple Calculus of Exception Handling - de Groote (1995) (Correct)
0.0: CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (Correct)
Similar documents based on text: More All
0.2: Proof Theory - Schwichtenberg (1999) (Correct)
0.2: Constructive Analysis with Witnesses - Helmut Schwichtenberg.. (Correct)
0.1: Refined Program Extraction from Classical Proofs - Berger, Buchholz.. (2000) (Correct)
BibTeX entry: (Update)
@misc{ schwichtenberg-program,
author = "Helmut Schwichtenberg",
title = "Program Extraction from Proofs",
url = "citeseer.ist.psu.edu/schwichtenberg02program.html" }
Citations (may not include all citations):14 Extracting constructive content from classical logic via con.. - Barbanera, Berardi - 1993
2 A predicative strong normalization proof for a -calculus wi.. (context) - Abel, Altenkirch - 2000
Documents on the same site (http://www.mathematik.uni-muenchen.de/~schwicht/): More
From Proofs to Programs in the Minlog System - The .. - Berger.. (1997) (Correct)
Finite Notations for Infinite Terms - Schwichtenberg (1998) (Correct)
From Higher Order Terms To Circuits - Schwichtenberg, Stroetmann (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