J. C. Reynolds, Mathematical foundations of software development, (Ehring et al., ed.), Lecture Notes in Computer Science, vol. 19, Springer, 1974, pp. 408--425. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Second-order unification and type inference for Church-style.. - Schubert (1998) (7 citations) (Correct)
....proof uses elementary techniques, which is important from the methodological point of view, because Goldfarb s proof [Gol81] highly relies on the undecidability of the tenth Hilbert s problem. 1 1 Introduction The Church style system F was independently introduced by Girard [Gir72] and Reynolds [Rey74] as an extension of the simply typed calculus a type system introduced of H. B. Curry [Cur69] As usual for type systems, the decidability of so called sequent decision problems was considered. A sequent decision problem in some type system A is a decision problem given some part of a ....
J. C. Reynolds, Mathematical foundations of software development, (Ehring et al., ed.), Lecture Notes in Computer Science, vol. 19, Springer, 1974, pp. 408--425.
Structural Subtyping and the Notion of Power Type - Cardelli (1988) (42 citations) (Correct)
....of) the variable x. In the non dependent case, when x does not occur in B, we reduce to an ordinary function space which can be written as AB. In case that A=Type, the dependent function type reduces to universal type quantification, written x. B, which can model parametric polymorphism [Reynolds 85] Full dependent types are strictly more powerful than these two special cases, since we can have types depending on values, as we shall see in the examples. All Formation E # S A:Type E, x:A # S B:Type E # S All(x:A)B : Type All Introduction E # S ....
J.C.Reynolds: Three approaches to type structure, Mathematical Foundations of Software Development, Lecture Notes in Computer Science n.185, Springer-Verlag, Berlin 1985, pp. 97-138.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....to explain most programming features. When used in full generality, they go much further than most existing languages. We have been careful to maintain the ability to type check these features easily. However, this is not the whole picture. Many interesting type systems lie well above our diagram [Reynolds 85] These include the Coquand and Huet theory of constructions [Coquand 85] Martin L f s dependent types [MartinL f 80] Burstall and Lampson s language Pebble [Burstall 84] and MacQueen s language DL [MacQueen 84b] There are benefits in going even higher up: Pebble and DL have a more general ....
J.C.Reynolds: Three approaches to type structure, Mathematical Foundations of Software Development, Lecture Notes in Computer Science 185, Springer-Verlag, Berlin 1985, pp. 97-138.
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