Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Brigitte Pientka
2010 – today
- 2013
[j14]Brigitte Pientka: An insider's look at LF type reconstruction: everything you (n)ever wanted to know. J. Funct. Program. 23(1): 1-37 (2013)- [c27]Francisco Ferreira, Stefan Monnier, Brigitte Pientka: Compiling contextual objects: bringing higher-order abstract syntax to programmers. PLPV 2013: 13-24
- [c26]Andreas Abel, Brigitte Pientka, David Thibodeau, Anton Setzer: Copatterns: programming infinite structures by observations. POPL 2013: 27-38
- 2012
- [c25]
- 2011
- [j13]Valeria de Paiva, Brigitte Pientka: Intuitionistic Modal Logic and Applications (IMLA 2008). Inf. Comput. 209(12): 1435-1436 (2011)
- [j12]Renate A. Schmidt, Brigitte Pientka: Preface: Special Issue of Selected Extended Papers of CADE-22. J. Autom. Reasoning 47(2): 107-109 (2011)
- [c24]Andreas Abel, Brigitte Pientka: Higher-Order Dynamic Pattern Unification for Dependent Types and Records. TLCA 2011: 10-26
- [c23]
- 2010
- [c22]Brigitte Pientka: Programming Inductive Proofs - A New Approach Based on Contextual Types. Verification, Induction, Termination Analysis 2010: 1-16
- [c21]Brigitte Pientka, Joshua Dunfield: Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description). IJCAR 2010: 15-21
- [c20]Brigitte Pientka: Beluga: Programming with Dependent Types, Contextual Data, and Contexts. FLOPS 2010: 1-12
- [c19]Amy P. Felty, Brigitte Pientka: Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison. ITP 2010: 227-242
- [c18]
2000 – 2009
- 2009
- [j11]Joshua Dunfield, Brigitte Pientka: Case Analysis of Higher-Order Data. Electr. Notes Theor. Comput. Sci. 228: 69-84 (2009)
- [j10]Brigitte Pientka: Higher-order term indexing using substitution trees. ACM Trans. Comput. Log. 11(1) (2009)
- 2008
- [j9]
- [j8]Brigitte Pientka, Xi Li, Florent Pompigne: Focusing the Inverse Method for LF: A Preliminary Report. Electr. Notes Theor. Comput. Sci. 196: 95-112 (2008)
- [j7]Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka: Contextual modal type theory. ACM Trans. Comput. Log. 9(3) (2008)
- [c17]Brigitte Pientka: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. POPL 2008: 371-382
- [c16]Brigitte Pientka, Joshua Dunfield: Programming with proofs and explicit contexts. PPDP 2008: 163-173
- 2007
- [j6]
- [j5]Brigitte Pientka: Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions. Electr. Notes Theor. Comput. Sci. 174(7): 41-60 (2007)
- [c15]Samuli Heilala, Brigitte Pientka: Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4. CADE 2007: 116-131
- [c14]Brigitte Pientka: Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF. TPHOLs 2007: 246-261
- 2006
- [c13]Brigitte Pientka: Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach. IJCAR 2006: 362-376
- [c12]Brigitte Pientka: Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks. ICLP 2006: 3-10
- 2005
- [j4]Brigitte Pientka: Verifying Termination and Reduction Properties about Higher-Order Logic Programs. J. Autom. Reasoning 34(2): 179-207 (2005)
- [c11]
- [c10]
- 2003
- [c9]
- [c8]Aleksandar Nanevski, Brigitte Pientka, Frank Pfenning: A modal foundation for meta-variables. MERLIN 2003
- [c7]
- 2002
- [j3]Brigitte Pientka: Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype. Electr. Notes Theor. Comput. Sci. 70(2): 110-123 (2002)
- [c6]Brigitte Pientka: A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming. ICLP 2002: 271-286
- 2001
- [j2]Christoph Kreitz, Brigitte Pientka: Connection-Driven Inductive Theorem Proving. Studia Logica 69(2): 293-326 (2001)
- [c5]Brigitte Pientka: Termination and Reduction Checking for Higher-Order Logic Programs. IJCAR 2001: 401-415
- 2000
- [c4]Christoph Kreitz, Jens Otten, Stephan Schmitt, Brigitte Pientka: Matrix-based Constructive Theorem Proving. Intellectics and Computational Logic 2000: 189-205
- [c3]
1990 – 1999
- 1999
- [j1]Brigitte Pientka, Christoph Kreitz: Automating Inductive Specification Proofs. Fundam. Inform. 39(1-2): 189-209 (1999)
- 1998
- [c2]Brigitte Pientka, Christoph Kreitz: Instantiation of Existentially Quantified Variables in Inductive Specification Proofs. AISC 1998: 247-258
- 1997
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-05 22:14 CEST by the dblp team