Frank Pfenning

Frank Pfenning is a professor of computer science, adjunct professor in the department of philosophy, and head of the Computer Science Department at… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2013
01219902013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
<lb>Dividing a omputation into stages and optimizing later phases using information from earlier phases is a familiar te hnique… (More)
Is this relevant?
Review
2008
Review
2008
To my parents and siblings. Acknowledgments The past three years as a PhD student have been interesting, exciting and enjoyable… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 3.1
  • figure 4.1
Is this relevant?
2005
2005
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic… (More)
  • figure 2.5
  • figure 2.6
  • figure 2.7
  • figure 4.2
  • figure 4.5
Is this relevant?
2004
2004
s of contributed talks PETER B. ANDREWS AND CHAD E. BROWN, Proving theorems and teaching logic with TPS and ETPS. Department of… (More)
Is this relevant?
1998
1998
An extension of the simply-typed -calculus allowing iteration and case reasoning over terms de ned by means of higher order… (More)
Is this relevant?
1997
1997
ion and function application employ the notion of substitution. Recall the inference rule and its representation in LF: e1 ↪→ lam… (More)
Is this relevant?
1997
1997
We report on an extension of the SML implementation of the logic programming language Elf [Pfe94] to support the check of… (More)
Is this relevant?
Review
1996
Review
1996
Overview A method is described for proving the weak equivalence theorem between natural-deduction style Lambek Categorial… (More)
Is this relevant?
1990
1990
This dissertation explores the problem of uni cation in various typed -calculi, developing and proving the correctness and… (More)
Is this relevant?