Thomas Studer. Constructive foundations for Featherweight Java. Preprint. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Formalizing Non-Termination of Recursive - Programs Reinhard Kahle (2001) Self-citation (Studer) (Correct)
No context found.
Thomas Studer. Constructive foundations for Featherweight Java. Preprint.
Formalizing Non-Termination of Recursive Programs - Kahle, Studer (2001) (1 citation) Self-citation (Studer) (Correct)
....r v s : r# r = s; f v T g : 1 i n (8x 2 A i )fx v gx; f =T g : f v T g g v T f: The formula rvs svr is equivalent to the standard partial equality relation r s. Hence, our de nedness ordering v is in accordance with the notion of partiality of our applicative theory. Studer [30] employs a least xed point operator to de ne a denotational semantics for Featherweight Java. This semantics features an overloading based object model. An overloaded function models type dependent computations and hence, it belongs to the intersection of several function spaces. Therefore, we de ....
....axioms are inspired by Kleene s T predicate, which therefore can be used to verify the axioms. So we can reduce LFP to Peano arithmetic. This will be important for obtaining expressively strong but proof theoretically weak systems for the study of object oriented programming languages, cf. Studer [30, 33]. The investigation of a least xed point operator in [17] was motivated by de ning an applicative theory with proof theoretic strength of Peano arithmetic for studying the interactive proof system LAMBDA [12, 13] This proof system was designed for proving properties of ML programs. Up to ....
Thomas Studer. Constructive foundations for Featherweight Java. Preprint.
Formalizing Non-Termination of Recursive Programs - Kahle, Studer (2000) (1 citation) Self-citation (Studer) (Correct)
....axioms are inspired by Kleene s T predicate, which therefore can be used to verify the axioms. So we can reduce LFP to Peano arithmetic. This will be important for obtaining expressively strong but proof theoretically weak systems for the study of object oriented programming languages, cf. Studer [30]. The investigation of a least fixed point operator in [17] was motivated by defining an applicative theory with proof theoretic strength of Peano arithmetic for studying the interactive proof system LAMBDA [12, 13] This proof system was designed for proving properties of ML programs. Up to ....
Thomas Studer. Constructive foundations for Featherweight Java. Preprint.
Regular Object Types - Gapeyev, Pierce (2003) (24 citations) (Correct)
No context found.
T. Studer. Constructive foundations for featherweight java. In R. Kahle, P. Schroeder-Heister, and R. Stark, editors, Proof Theory in Computer Science. Springer-Verlag, 2001. Lecture Notes in Computer Science, volume 2183.
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