Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CADE
2003
Springer

favoriteEmaildiscussreport

112views Logical Reasoning» more CADE 2003»

Subset Types and Partial Functions

14 years 4 months ago

Subset Types and Partial Functions

Download www.cs.uiowa.edu

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. Validity in PFsub is then reduced to validity in PF by a translation.

Aaron Stump

Real-time Traffic

Automated Reasoning | CADE 2003 | Logic Pf |

claim paper

Related Content

» Towards a Type System for Security APIs

» A classification of finite partial linear spaces with a primitive rank 3 automorphism grou...

» A Type of Partial Recursive Functions

» Functioning without Closure TypeSafe Customized Function Representations for Standard ML

» Fast and loose reasoning is morally correct

» Functional Analysis Evaluation of Response Intensities Tailoring ANOVA for Lists of Expre...

» Optimization and the Miranda Approach in Detecting HorseshoeType Chaos by Computer

» TypeDirected Partial Evaluation

» Admissibility of Fixpoint Induction over Partial Types

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	CADE
Authors	Aaron Stump

Comments (0)