Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
System F
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== {{refbegin}} *{{cite conference | first = Jean-Yves | last = Girard | author-link = Jean-Yves Girard | title = Une Extension de l'Interpretation de Gödel à l'Analyse, et son Application à l'Élimination des Coupures dans l'Analyse et la Théorie des Types | book-title = Proceedings of the Second Scandinavian Logic Symposium | date = 1971 | location = Amsterdam | pages = 63–92 | doi = 10.1016/S0049-237X(08)70843-7 }} * {{citation | last = Girard | first = Jean-Yves | author-link = Jean-Yves Girard | year = 1972 | title = Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur | type = Ph.D. thesis | publisher = Université Paris 7 | language = fr }}. *{{cite conference | first = John | last = Reynolds | author-link = John C. Reynolds | title = Towards a Theory of Type Structure | date = 1974 | url = https://kilthub.cmu.edu/articles/journal_contribution/Towards_a_Theory_of_Type_Structure/6611015/files/12103187.pdf }} *{{cite book |first1=Jean-Yves |last1=Girard |first2=Yves |last2=Lafont |first3=Paul |last3=Taylor |title=Proofs and Types |url=http://www.PaulTaylor.EU/stable/Proofs%2BTypes.html |date=1989 |publisher=Cambridge University Press |isbn=978-0-521-37181-0}} *{{cite conference |first=J. B. |last=Wells |chapter=Typability and type checking in the second-order lambda-calculus are equivalent and undecidable |title=Proceedings of the 9th Annual [[IEEE]] Symposium on Logic in Computer Science (LICS) |pages=176–185 |year=1994 |doi= 10.1109/LICS.1994.316068|isbn=0-8186-6310-3}} [http://www.macs.hw.ac.uk/~jbw/papers/Wells:Typability-and-Type-Checking-in-the-Second-Order-Lambda-Calculus-Are-Equivalent-and-Undecidable:LICS-1994.ps.gz Postscript version] {{refend}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)