Switch to: References

Add citations

You must login to add citations.
  1. Explicit mathematics: power types and overloading.Thomas Studer - 2005 - Annals of Pure and Applied Logic 134 (2-3):284-302.
    Systems of explicit mathematics provide an axiomatic framework for representing programs and proving properties of them. We introduce such a system with a new form of power types using a monotone power type generator. These power types allow us to model impredicative overloading. This is a very general form of type dependent computation which occurs in the study of object-oriented programming languages. We also present a set-theoretic interpretation for monotone power types. Thus establishing the consistency our system of explicit mathematics.
    Download  
     
    Export citation  
     
    Bookmark  
  • Theories of types and names with positive stratified comprehension.Pierluigi Minari - 1999 - Studia Logica 62 (2):215-242.
    We introduce a certain extension of -calculus, and show that it has the Church-Rosser property. The associated open-term extensional combinatory algebra is used as a basis to construct models for theories of Explict Mathematics (formulated in the language of "types and names") with positive stratified comprehension. In such models, types are interpreted as collections of solutions (of terms) w.r. to a set of numerals. Exploiting extensionality, we prove some consistency results for special ontological axioms which are refutable under elementary comprehension.
    Download  
     
    Export citation  
     
    Bookmark   1 citation