Conference Compiling the polymorphic &lgr;-calculus 1991 • ACM Sigplan Notices • 26(9):285-296 Michaylov S, Pfenning F
Journal Article COMPILING THE POLYMORPHIC LAMBDA-CALCULUS 1991 • ACM Sigplan Notices • 26(9):285-296 MICHAYLOV S, PFENNING F
Conference Declarative alternative to `assert' in logic programming 1991 372-386 Dietzen S, Pfenning F
Journal Article METACIRCULARITY IN THE POLYMORPHIC LAMBDA-CALCULUS 1991 • Theoretical Computer Science • 89(1):137-159 PFENNING F, LEE P
Journal Article REFINEMENT TYPES FOR ML 1991 • ACM Sigplan Notices • 26(6):268-277 FREEMAN T, PFENNING F
Conference Unification and anti-unification in the calculus of constructions 1991 • Proceedings - Symposium on Logic in Computer Science • 74-85 Pfenning F
Journal Article UNIFORM PROOFS AS A FOUNDATION FOR LOGIC PROGRAMMING 1991 • Annals of Pure and Applied Logic • 51(1-2):125-157 MILLER D, NADATHUR G, PFENNING F, SCEDROV A
Conference INDUCTIVELY DEFINED TYPES IN THE CALCULUS OF CONSTRUCTIONS 1990 • MATHEMATICAL FOUNDATIONS OF PROGRAMMING SEMANTICS / • 442:209-228 PFENNING F, PAULINMOHRING C
Journal Article INDUCTIVELY DEFINED TYPES IN THE CALCULUS OF CONSTRUCTIONS 1990 • Lecture Notes in Computer Science • 442:209-228 PFENNING F, PAULINMOHRING C
Conference Presenting intuitive deductions via symmetric simplification 1990 • Lecture Notes in Computer Science • 449:336-350 Pfenning F, Nesmith D
Chapter Program development through proof transformation 1990 • Contemporary Mathematics • 106:251-262 Pfenning F
Conference The TPS theorem proving system 1990 • Lecture Notes in Computer Science • 449 LNAI:641-642 Andrews PB, Issar S, Nesmith D, Pfenning F
Chapter The TPS theorem proving system 1990 • Lecture Notes in Computer Science • 449:641-642 Andrews PB, Issar S, Nesmith D, Pfenning F
Conference Tutorial on λProlog 1990 • Lecture Notes in Computer Science • 449:682-682 Felty A, Gunter E, MIller D, Pfenning F
Chapter Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization 1989 447-449 Dietzen S, Pfenning F
Journal Article Jean H. Gallier. Logic for computer science. Foundations of automatic theorem proving. Harper & Row computer science and technology series. Harper & Row, New York1986, xv + 511 pp. 1989 • Journal of Symbolic Logic (JSL) • 54(1):288-289 Pfenning F
Journal Article LEAP - A LANGUAGE WITH EVAL AND POLYMORPHISM 1989 • Lecture Notes in Computer Science • 352:345-359 PFENNING F, LEE P
Journal Article THE ERGO ATTRIBUTE SYSTEM 1989 • ACM Sigplan Notices • 24(2):110-120 NORD RL, PFENNING F
Journal Article THE ERGO SUPPORT SYSTEM - AN INTEGRATED SET OF TOOLS FOR PROTOTYPING INTEGRATED ENVIRONMENTS 1989 • ACM Sigplan Notices • 24(2):25-34 LEE P, PFENNING F, ROLLINS G, SCHERLIS W
Journal Article HIGHER-ORDER ABSTRACT SYNTAX 1988 • ACM Sigplan Notices • 23(7):199-208 PFENNING F, ELLIOTT C
Conference Higher-order abstract syntax 1988 • ACM Sigplan Notices • 23(7):199-208 Pfenning F, Elliott C
