Aaron Stump  Home/Search
Context
Related
| wustl.edu/papers/cade03.ps.gz 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: wustl.edu/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A classical higher-order logic PFsub of partial functions is defined. The logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset types and dependent types. (Update)
Active bibliography (related documents): More All
0.5: Imperative LF Meta-Programming - Stump (2004) (Correct)
0.3: Extensions of Pure Type Systems - Barthe (1995) (Correct)
0.3: On Coquand's "An Analysis of Girard's Paradox" - Stump (Correct)
Similar documents based on text: More All
0.1: Logical Semantics for the Rewriting Calculus - Stump, Schürmann (2004) (Correct)
0.1: Validated Proof-Producing Decision Procedures - Klapper, Stump (2004) (Correct)
0.1: A Framework for Cooperating Decision Procedures - Barrett, Dill, Stump (2000) (Correct)
BibTeX entry: (Update)
@misc{ stump-subset,
author = "Aaron Stump",
title = "Subset Types and Partial Functions",
url = "citeseer.ist.psu.edu/stump03subset.html" }
Citations (may not include all citations):434 A Framework for Defining Logics - Harper, Honsell et al. - 1993
419 A formulation of the simple theory of types (context) - Church - 1940
295 PVS: A Prototype Verification System (context) - Owre, Rushby et al. - 1992
229 Foundations for Programming Languages (context) - Mitchell - 1996
151 An Introduction to Mathematical Logic and Type Theory: to Tr.. (context) - Andrews - 1965
68 Logics and Type systems - Geuvers - 1993
61 Une extension de l'interpretation de Godel a l'analyse (context) - Girard - 1971
53 A partial functions version of Church's simple theory of typ.. (context) - Farmer - 1990
44 An analysis of Girard's paradox - Coquand - 1986
38 Categorical Logic and Type Theory (context) - Jacobs - 1999
34 Foundations of Constructive Mathematics: Metamathematical St.. (context) - Beeson - 1985
33 Handbook of Automated Reasoning (context) - Robinson, Voronkov - 2001
30 A Mechanization of Strong Kleene Logic for Partial Functions - Kerber, Kohlhase - 1994
24 A simple type theory with partial functions and subtypes (context) - Farmer - 1993
21 Subtypes for Specifications: Predicate Subtyping in PVS - Rushby, Owre et al. - 1998
9 A Set Theory with Support for Partial Functions - Farmer, Guttman - 2000
7 A Transfinite Type Theory with Type Variables (context) - Andrews - 1965
7 The formal semantics of PVS - Owre, Shankar - 1999
7 Checking Validities and Proofs with CVC and flea (context) - Stump - 2002
7 Mechanising Partiality without Re-Implementation - Kerber, Kohlhase - 1997
3 Theoretical Computer Science (context) - Aspinall, Compagnoni et al. - 2001
3 A new paradox in type theory - Coquand - 1994
2 Volume 2 of Robinson and Voronkov (context) - Pfenning, chapter - 2001
1 A Proofs of the Tautology and Deduction Theorems The proofs .. (context) - Stump, partial et al. - 2003
Documents on the same site (http://cl.cse.wustl.edu/papers.html): More
Rogue Decision Procedures - Stump, Deivanayagam, Kathol.. (2003) (Correct)
Logical Semantics for the Rewriting Calculus - Stump, Schürmann (2004) (Correct)
Validated Proof-Producing Decision Procedures - Klapper, Stump (2004) (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