Thomas Studer  Home/Search
Context Related
| iamwww.unibe.ch/~tstuder/pape...otn.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/~tstuder/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this article we introduce the system OTN of explicit mathematics based on elementary separation, product, join and weak power types. We present a set-theoretical model for OTN, and we develop in OTN a theory of impredicative overloading. Together this yields a solution to the problem of impredicativity encountered in denotational semantics for overloading and late-binding. Further, our work provides a first example of an application of power types in explicit mathematics. Keywords:... (Update)
Similar documents based on text: More All
0.5: Constructive Foundations for Featherweight Java - Studer (2001) (Correct)
0.3: Polynomial Time Operations in Explicit Mathematics - Strahm (1997) (Correct)
0.3: Unknown - This Contribution Has (Correct)
Related documents from co-citation: More All
10: Logics for termination and correctness of functional programs II: Logics of stre.. (context) - Feferman - 1990
5: Polymorphic typed lambda-calculi in a type-free axiomatic framework (context) - Feferman - 1990
5: Logics of partial terms for strict and non-strict functional programming languag.. (context) - Stark, constant - 1998
BibTeX entry: (Update)
Thomas Studer. Impredicative overloading in explicit mathematics. Submitted. http://citeseer.ist.psu.edu/studer00impredicative.html More
@misc{ studer-impredicative,
author = "T. Studer",
title = "Impredicative overloading in explicit mathematics",
text = "Thomas Studer. Impredicative overloading in explicit mathematics. Submitted.",
url = "citeseer.ist.psu.edu/studer00impredicative.html" }
Citations (may not include all citations):112 Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
88 A calculus for overloaded functions with subtyping - Castagna, Ghelli et al. - 1995
69 A language and axioms for explicit mathematics (context) - Feferman - 1975
63 Constructive theories of functions and classes (context) - Feferman - 1979
43 Logics for termination and correctness of functional program.. (context) - Feferman - 1992
43 Object-Oriented Programming: A Unified Foundation (context) - Castagna - 1997
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
18 early: a calculus with overloading and early binding (context) - Castagna, Ghelli et al. - 1993
11 Logics of partial terms for strict and non-strict functional.. (context) - Stark, constant - 1998
11 Induction in the elementary theory of types and names (context) - Jager - 1988
9 call-by-name and the logic of values (context) - Stark - 1997
7 A static type system for late binding overloading (context) - Ghelli - 1991
6 and Thomas Strahm (context) - Jager, Kahle - 1999
5 Applikative Theorien und explizite Mathematik (context) - Jager - 1997
5 str : a calculus with overloading and late-binding (context) - Studer, for
1 Power types in explicit mathematics (context) - Jager - 1997
1 Relating Quine's NF to Feferman's EM (context) - Cantini - 1999
1 17 Address Thomas Studer Institut fur Informatik und angewan.. (context) - Turner, of et al. - 1996
1 On power set in explicit mathematics (context) - Glass - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.iam.unibe.ch/~tstuder/): More
Explicit mathematics: W-type, models - Studer (1997) (Correct)
A Semantics for ...: A Calculus With Overloading and Late-Binding - Studer (1999) (Correct)
Universes in Explicit Mathematics - Jäger, Kahle, Studer (1999) (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