#### Filter Results:

- Full text PDF available (187)

#### Publication Year

1984

2018

- This year (6)
- Last 5 years (43)
- Last 10 years (104)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Frank Pfenning, Carsten SchÃ¼rmann
- CADE
- 1999

Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. It relies on the LF type theory andâ€¦ (More)

- Frank Pfenning, Conal Elliott
- PLDI
- 1988

We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulationâ€¦ (More)

- Hongwei Xi, Frank Pfenning
- POPL
- 1999

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) languageâ€¦ (More)

- Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov
- Ann. Pure Appl. Logic
- 1991

A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that theâ€¦ (More)

- Frank Pfenning, Rowan Davies
- Mathematical Structures in Computer Science
- 2001

We reconsider the foundations of modal logic, following Martin-LÃ¶fâ€™s methodology of distinguishing judgments from propositions. We give constructive meaning explanations for necessity and possibilityâ€¦ (More)

- LuÃs Caires, Frank Pfenning
- CONCUR
- 2010

Several type disciplines for Ï€-calculi have been proposed in which linearity plays a key role, even if their precise relationship with pure linear logic is still not well understood. In this paper,â€¦ (More)

- Timothy S. Freeman, Frank Pfenning
- PLDI
- 1991

We describe a refinement of MLâ€™s type system allowing the specification of recursively defined subtypes of user-defined datatypes. The resulting system of refinement types preserves desirableâ€¦ (More)

- Hongwei Xi, Frank Pfenning
- PLDI
- 1998

We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables theâ€¦ (More)

- Frank Pfenning
- 1991

3 A Meta-Logic for Unification 4 3.1 A First-Order Unification Logic with Quantifier Dependencies . . . . . . . . . . . . . 5 3.2 Transformations for First-Order Unification . . . . . . . . . . . . .â€¦ (More)

One of the major challenges of building software systems is to ensure that the various components fit together in a well-defined manner. This problem is exacerbated by the recent advent of softwareâ€¦ (More)