| 词条 | Pure type system |
| 释义 |
In the branches of mathematical logic known as proof theory and type theory, a pure type system (PTS), previously known as a generalized type system (GTS), is a form of typed lambda calculus that allows an arbitrary number of sorts and dependencies between any of these. The framework can be seen as a generalisation of Barendregt's lambda cube, in the sense that all corners of the cube can be represented as instances of a PTS with just two sorts.[1][2] In fact Barendregt (1991) framed his cube in this setting.[3] Pure type systems may obscure the distinction between types and terms and collapse the type hierarchy, as is the case with the calculus of constructions, but this is not generally the case, e.g. the simply typed lambda calculus allows only terms to depend on terms. Pure type systems were independently introduced by Stefano Berardi (1988) and Jan Terlouw (1989).[1][2] Barendregt discussed them at length in his subsequent papers.[4] In his PhD thesis,[5] Berardi defined a cube of constructive logics akin to the lambda cube (these specifications are non-dependent). A modification of this cube was later called the L-cube by Geuvers, who in his PhD thesis extended the Curry–Howard correspondence to this setting.[6] Based on these ideas, Barthe and others defined classical pure type systems (CPTS) by adding a double negation operator.[7] Similarly, in 1998, Tijn Borghuis introduced modal pure type systems (MPTS).[8] Roorda has discussed the application of pure type systems to functional programming; and Roorda and Jeuring have proposed a programming language based on pure type systems.[9] The systems from the lambda cube are all known to be strongly normalizing. Pure type systems in general need not be, for example System U from Girard's paradox is not. (Roughly speaking, Girard found pure systems in which one can express the sentence "the types form a type".) Furthermore, all known examples of pure type systems that are not strongly normalizing are not even (weakly) normalizing: they contain expressions that do not have normal forms, just like the untyped lambda calculus{{Citation needed|date=April 2013}}. It is a major open problem in the field whether this is always the case, i.e. whether a (weakly) normalizing PTS always has the strong normalization property. This is known as the Barendregt–Geuvers–Klop conjecture[10]{{rp|358}} (named after Henk Barendregt, Herman Geuvers, and Jan Willem Klop). ImplementationsThe following programming languages have pure type systems:{{citation needed|date=May 2013}}
See also
Notes1. ^1 {{cite book|last=Pierce|first=Benjamin|title=Types and Programming Languages|publisher=MIT Press|year=2002|isbn=0-262-16209-1|page= 466}} 2. ^1 {{cite book | first1 = Fairouz D. | last1 = Kamareddine | first2 = Twan | last2 = Laan | first3 = Rob P. | last3 = Nederpelt | title = A modern perspective on type theory: from its origins until today | publisher = Springer | year = 2004 | isbn = 1-4020-2334-0 | chapter = Section 4c: Pure type systems | page = 116 }} 3. ^{{cite journal |authorlink=H.P. Barendregt |first=H. P. |last=Barendregt |url= https://www.researchgate.net/publication/216300104_An_Introduction_to_Generalized_Type_Systems |title=Introduction to generalized type systems |journal=Journal of Functional Programming |volume=1 |issue=2 |pages=125–154 |year=1991 }} 4. ^{{cite book|editor=S. Abramsky, D. Gabbay and T. Maibaum|author=H. Barendregt|chapter=Lambda calculi with types|chapterurl=ftp://ftp.cs.ru.nl/pub/CompMath.Found/HBK.ps|title=Handbook of Logic in Computer Science|publisher=Oxford Science Publications|year=1992}} 5. ^{{cite thesis | first = S. | last = Berardi | title = Type dependence and Constructive Mathematics | degree = PhD | publisher = University of Torino | year = 1990 }} 6. ^{{cite thesis | first = H. | last = Geuvers | title = Logics and Type Systems | citeseerx = 10.1.1.56.7045 | degree = PhD | publisher = University of Nijmegen | year = 1993 }} 7. ^{{cite journal|author=G. Barthe|author2=J. Hatcliff |author3=M. H. Sørensen |title=A Notion of Classical Pure Type System|citeseerx = 10.1.1.32.1371|journal=Electronic Notes in Theoretical Computer Science|volume=6|year=1997|pages=4–59|doi=10.1016/S1571-0661(05)80170-7}} 8. ^{{cite journal |first=Tijn |last=Borghuis |title=Modal Pure Type Systems |journal=Journal of Logic, Language and Information |volume=7 |issue=3 |year=1998 |pages=265–296 |doi=10.1023/A:1008254612284 }} 9. ^{{cite web|url=http://people.cs.uu.nl/johanj/MSc/jwroorda/|author=Jan-Willem Roorda|author2=Johan Jeuring |title=Pure Type Systems for Functional Programming}} Roorda's masters' thesis (linked from the cited page) also contains a general introduction to pure type systems. 10. ^{{cite book |first=Morten Heine |last=Sørensen |first2=Paweł |last2=Urzyczyn |title=Lectures on the Curry–Howard isomorphism |location= |publisher=Elsevier |year=2006 |isbn=0-444-52077-5 |chapter=Pure type systems and the lambda cube }} References{{refbegin}}
Further reading
External links
3 : Proof theory|Type theory|Lambda calculus |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。