| 2009 |
|---|
| 27 | EE | Joshua Dunfield,
Brigitte Pientka:
Case Analysis of Higher-Order Data.
Electr. Notes Theor. Comput. Sci. 228: 69-84 (2009) |
| 2008 |
|---|
| 26 | EE | Brigitte Pientka:
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions.
POPL 2008: 371-382 |
| 25 | EE | Brigitte Pientka,
Joshua Dunfield:
Programming with proofs and explicit contexts.
PPDP 2008: 163-173 |
| 24 | EE | Aleksandar Nanevski,
Frank Pfenning,
Brigitte Pientka:
Contextual modal type theory.
ACM Trans. Comput. Log. 9(3): (2008) |
| 23 | EE | Brigitte Pientka,
Carsten Schürmann:
Preface.
Electr. Notes Theor. Comput. Sci. 196: 1 (2008) |
| 22 | EE | Brigitte Pientka,
Xi Li,
Florent Pompigne:
Focusing the Inverse Method for LF: A Preliminary Report.
Electr. Notes Theor. Comput. Sci. 196: 95-112 (2008) |
| 2007 |
|---|
| 21 | EE | Samuli Heilala,
Brigitte Pientka:
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4.
CADE 2007: 116-131 |
| 20 | EE | Brigitte Pientka:
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF.
TPHOLs 2007: 246-261 |
| 19 | EE | Alberto Momigliano,
Brigitte Pientka:
Preface.
Electr. Notes Theor. Comput. Sci. 174(5): 1-2 (2007) |
| 18 | EE | Brigitte Pientka:
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions.
Electr. Notes Theor. Comput. Sci. 174(7): 41-60 (2007) |
| 2006 |
|---|
| 17 | EE | Brigitte Pientka:
Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks.
ICLP 2006: 3-10 |
| 16 | EE | Brigitte Pientka:
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach.
IJCAR 2006: 362-376 |
| 2005 |
|---|
| 15 | EE | Brigitte Pientka:
Tabling for Higher-Order Logic Programming.
CADE 2005: 54-68 |
| 14 | EE | Susmit Sarkar,
Brigitte Pientka,
Karl Crary:
Small Proof Witnesses for LF.
ICLP 2005: 387-401 |
| 13 | EE | Brigitte Pientka:
Verifying Termination and Reduction Properties about Higher-Order Logic Programs.
J. Autom. Reasoning 34(2): 179-207 (2005) |
| 2003 |
|---|
| 12 | EE | Brigitte Pientka,
Frank Pfenning:
Optimizing Higher-Order Pattern Unification.
CADE 2003: 473-487 |
| 11 | EE | Brigitte Pientka:
Higher-Order Substitution Tree Indexing.
ICLP 2003: 377-391 |
| 10 | EE | Aleksandar Nanevski,
Brigitte Pientka,
Frank Pfenning:
A modal foundation for meta-variables.
MERLIN 2003 |
| 2002 |
|---|
| 9 | EE | Brigitte Pientka:
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming.
ICLP 2002: 271-286 |
| 8 | EE | Brigitte Pientka:
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype.
Electr. Notes Theor. Comput. Sci. 70(2): (2002) |
| 2001 |
|---|
| 7 | EE | Brigitte Pientka:
Termination and Reduction Checking for Higher-Order Logic Programs.
IJCAR 2001: 401-415 |
| 6 | | Christoph Kreitz,
Brigitte Pientka:
Connection-Driven Inductive Theorem Proving.
Studia Logica 69(2): 293-326 (2001) |
| 2000 |
|---|
| 5 | | Christoph Kreitz,
Jens Otten,
Stephan Schmitt,
Brigitte Pientka:
Matrix-based Constructive Theorem Proving.
Intellectics and Computational Logic 2000: 189-205 |
| 4 | | Christoph Kreitz,
Brigitte Pientka:
Matrix-Based Inductive Theorem Proving.
TABLEAUX 2000: 294-308 |
| 1999 |
|---|
| 3 | | Brigitte Pientka,
Christoph Kreitz:
Automating Inductive Specification Proofs.
Fundam. Inform. 39(1-2): 189-209 (1999) |
| 1998 |
|---|
| 2 | EE | Brigitte Pientka,
Christoph Kreitz:
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs.
AISC 1998: 247-258 |
| 1997 |
|---|
| 1 | | Stefan Gerberding,
Brigitte Pientka:
Structured Incremental Proof Planning.
KI 1997: 63-74 |
