Вы здесь

Pfenning F.

Автор:

Вид Название Год Автор Серия Редакторы Колл. автор Источник Дата поступления
СТ Compiling the Polymorphic Lambda-Calculus 1991 Michaylov S., Pfenning F. SIGPLAN Notices 26.10.1991
СТ Metacircularity in the polymorphic lambda-calculus 1991 Pfenning F., Lee P. Theoretical Computer Science 28.11.1991
СТ TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory 1994 Andrews P. B., Bishop M., Issar S., Nesmith D., Pfenning F., Xi H. Lecture Notes in Computer Science 21.06.1994
СТ A Declarative Alternative to "assert" in Logic Programming 1991 Deitzen S., Pfenning F. Logic Programming: Proc./1991 Intern. Symp. 29.12.1994
СТ Efficient Resource Management for Linear Logic Proof Search 1996 Cervesato I., Hodas J. S., Pfenning F. Lecture Notes in Artificial Intelligence 17.04.1996
СТ Mode and Termination Checking for Higher-Order Logic Programs 1996 Rohwedder E., Pfenning F. Lecture Notes in Computer Science 18.05.1996
СТ Run-time Code Generation and Modal-ML 1998 Wickline P., Lee P., Pfenning F. SIGPLAN Notices 16.09.1998
СТ Natural Deduction Intuitionistic Non-commutative Linear Logic 1999 Polakow J., Pfenning F. Lecture Notes in Computer Science 21.04.1999
СТ Tridirectional Typechecking 2004 Dunfield J., Pfenning F. POPL 2004 09.06.2004
СТ Type-Directed Concurrency 2005 Garg D., Pfenning F. Lecture Notes in Computer Science Lecture Notes in Computer Science 19.10.2005