- Preliminary Report. Final version to appear in: c A. Abel & B. Pientka
- Overcoming performance barries: ecient proof search in logical frameworks
- Contextual Modal Type Theory ALEKSANDAR NANEVSKI
- Tabled higher-order logic programming Brigitte Pientka
- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison
- Augusta Ada Byron, Countess of Lovelace Ada Byron wird als Tochter von Anna Byron und dem Dichter Lord Byron 1815 in England
- A proof-theoretic foundation for tabled higher-order logic programming
- Contextual Modal Type Theory ALEKSANDAR NANEVSKI
- A Modal Foundation for Meta-Variables Aleksandar Nanevski, Brigitte Pientka, and Frank Pfenning
- Programming inductive proofs: a new approach based on contextual types
- Tabled higherorder logic programming Brigitte Pientka
- Structured Incremental Proof Planning Stefan Gerberding Brigitte Pientka
- Under consideration for publication in Math. Struct. in Comp. Science Programming proofs: a novel approach based
- Higher-order substitution tree indexing Brigitte Pientka ?
- Termination and Reduction Checking in the Logical Framework
- Proof Pearl: The power of higher-order encodings in the logical framework LF
- Matrixbased Constructive Theorem Proving Christoph Kreitz Jens Otten Stephan Schmitt Brigitte Pientka
- www.newphytologist.org 243 Blackwell Publishing Ltd
- Submitted to: c A. Abel & B. Pientka
- Small proof witnesses for logical frameworks Susmit Sarkar 1? , Brigitte Pientka 2 , and Karl Crary 1
- Higherorder term indexing using substitution trees BRIGITTE PIENTKA
- A Typetheoretic Foundation for Programming with Higherorder Abstract Syntax and Firstclass Substitutions
- Computational Thinking: Languages and Computation Prof. Brigitte Pientka
- Programming with Proofs and Explicit Contexts [Extended Abstract]
- Fundamenta Informaticae 34 (1998) 1--20 1 Automating inductive Specification Proofs in NuPRL \Lambda
- How to prove it Brigitte Pientka
- Connection-Driven Inductive Theorem Proving Christoph Kreitz (kreitz@cs.cornell.edu)
- Tabling for higher-order logic programming Brigitte Pientka
- Higher-order term indexing using substitution trees BRIGITTE PIENTKA
- Higherorder term indexing using substitution trees BRIGITTE PIENTKA
- A Heuristic for Case Analysis Brigitte Pientka \Lambda
- Tabled higher-order logic programming Brigitte Pientka
- Verifying termination and reduction properties about higherorder logic programs
- Programming with Proofs and Explicit Contexts [Extended Abstract]
- Higher-order term indexing using substitution trees BRIGITTE PIENTKA
- Efficient proof search in the logical framework Brigitte Pientka
- Covering all bases: design and implementation of case analysis for contextual objects
- ZU064-05-FPR recon 10 August 2010 8:39 An insider's look at LF type reconstruction
- Grace Murray Hopper eine Computerpionierin Kindheit und Jugend
- Verifying termination and reduction properties about higher-order logic programs
- Overcoming performance barries: efficient verification techniques for logical frameworks
- Tabled higher-order logic programming
- Programming in Standard ML (WORKING DRAFT OF AUGUST 20, 2009.)
- Termination and Reduction Checking for HigherOrder Logic Programs
- Overcoming performance barries: e#cient verification techniques for logical frameworks
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- Beluga: A Framework for Programming and Reasoning with Deductive Systems
- Case Analysis of Higher-Order Data Joshua Dunfield and Brigitte Pientka
- Tabling for higher-order logic programming Brigitte Pientka
- Case analysis of higher-order data Joshua Dunfield and Brigitte Pientka
- or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page.
- Functional programming with dependently-typed higher-order data Brigitte Pientka Joshua Dunfield
- Termination and Reduction Checking for Higher-Order Logic Programs
- Contextual Modal Type Theory ALEKSANDAR NANEVSKI
- Programming in Standard ML (WORKING DRAFT OF AUGUST 20, 2009.)
- About coding style 15-212 Spring 2004
- Higher-order term indexing using substitution trees BRIGITTE PIENTKA
- A Type-theoretic Foundation for Programming with Higher-order Abstract Syntax and First-class Substitutions
- Eliminating redundancy in higher-order unification: a lightweight approach
- Beluga: programming with dependent types, contextual data, and contexts
- Tabled higher-order logic programming
- A proof-theoretic foundation for tabled higher-order logic programming
- Overcoming Performance Barriers: efficient proof search in logical frameworks
- Tabled higher-order logic programming
- Higher-order term indexing using substitution trees App1 This document is the online-only appendix to
- In this essay I will describe the feelings, ideas, and the criticisms which I had while attending the Grace Hopper Celebration 9197.
- Verifying termination and reduction properties about higherorder logic programs
- Towards a Dependent Modal Type Theory Aleksandar Nanevski, Brigitte Pientka, Frank Pfenning
- Higher-order term indexing Ecient term indexing techniques have resulted in dramatic speed improvements in
- Electronic Notes in Theoretical Computer Science 70 No. 2 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 14 pages
- Tabled Higher-Order Logic Programming Brigitte Pientka
- Research Statement Brigitte Pientka
- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
- Higher-order term indexing using substitution trees BRIGITTE PIENTKA
- Practical Foundations for Programming Robert Harper
- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison
- Efficient proof search in the logical framework Brigitte Pientka
- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
- A Matrix Characterization of Validity for Multimodal Logics
- Optimizing Higher-Order Pattern Uni cation Brigitte Pientka and Frank Pfenning ?
- Matrixbased Inductive Theorem Proving Christoph Kreitz 1 & Brigitte Pientka 2
- Appendix to "Reasoning with Higher-Order Abstract Syntax and Contexts: A
- To appear in EPTCS. c M. Boespflug & B. Pientka
- To appear in EPTCS. c M. Boespflug & B. Pientka
- Programming with Binders and Indexed Data-Types Andrew Cave Brigitte Pientka
