Brigitte Pientka

发表

Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers, Organising Commitee

Delia Kesner, Brigitte Pientka, 2016, FSCD.

Connection-Driven Inductive Theorem Proving

Christoph Kreitz, Brigitte Pientka, C. Kreitz, 2001, Stud Logica.

Higher-order term indexing using substitution trees

Brigitte Pientka, B. Pientka, 2009, TOCL.

Well-Founded Recursion over Contextual Objects

Brigitte Pientka, Andreas Abel, 2015, TLCA.

Focusing the Inverse Method for LF: A Preliminary Report

Xi Li, Brigitte Pientka, Florent Pompigne, 2007, LFMTP@CADE.

Well-founded recursion with copatterns and sized types

Brigitte Pientka, Andreas Abel, Andreas Abel, 2016, Journal of Functional Programming.

POPLMark reloaded: Mechanizing proofs by logical relations

Alberto Momigliano, Brigitte Pientka, Andreas Abel, 2019, Journal of Functional Programming.

Unnesting of Copatterns

Brigitte Pientka, Andreas Abel, Anton Setzer, 2014, RTA-TLCA.

Fair reactive programming

Prakash Panangaden, Brigitte Pientka, Andrew Cave, 2014, POPL.

Case Analysis of Higher-Order Data

Brigitte Pientka, Joshua Dunfield, 2009, Electron. Notes Theor. Comput. Sci..

Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype

Brigitte Pientka, 2002, Electron. Notes Theor. Comput. Sci..

Programming with proofs and explicit contexts

Brigitte Pientka, Joshua Dunfield, 2008, PPDP '08.

Mechanizing Proofs about Mendler-style Recursion

Brigitte Pientka, Andrew Cave, Rohan Jacob-Rao, 2016, LFMTP.

Programming Inductive Proofs - A New Approach Based on Contextual Types

Brigitte Pientka, 2010, Verification, Induction, Termination Analysis.

Semantical Analysis of Contextual Types

Ulrich Schöpp, Brigitte Pientka, B. Pientka, 2020, FoSSaCS.

POPLMark reloaded: mechanizing logical relations proofs (invited talk)

Brigitte Pientka, 2018, CPP.

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09 - 11, 2017

Wim Vanhoof, Brigitte Pientka, 2017, PPDP.

1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal

Delia Kesner, Brigitte Pientka, 2016, FSCD.

Tabled higher-order logic programming

Frank Pfenning, Brigitte Pientka, F. Pfenning, 2003 .

A Modal Analysis of Metaprogramming, Revisited (Invited Talk)

Brigitte Pientka, 2020, FSCD.

Preface: Special Issue of Selected Extended Papers of CADE-22

Renate A. Schmidt, Brigitte Pientka, 2010, Journal of Automated Reasoning.

Relating System F and Lambda2: A Case Study in Coq, Abella and Beluga

Gert Smolka, Brigitte Pientka, Jonas Kaiser, 2017, FSCD.

A case study in programming coinductive proofs: Howe’s method

Alberto Momigliano, Brigitte Pientka, David Thibodeau, 2018, Mathematical Structures in Computer Science.

Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions

Brigitte Pientka, 2007, Electron. Notes Theor. Comput. Sci..

Beluga: Programming with Dependent Types, Contextual Data, and Contexts

Brigitte Pientka, B. Pientka, 2010, FLOPS.

Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

Brigitte Pientka, B. Pientka, 2006, IJCAR.

Programs Using Syntax with First-Class Binders

Brigitte Pientka, Francisco Ferreira, B. Pientka, 2017, ESOP.

Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF

Brigitte Pientka, 2007, TPHOLs.

Index-Stratified Types

Brigitte Pientka, David Thibodeau, Rohan Jacob-Rao, 2018, FSCD.

Preface

Alberto Momigliano, Brigitte Pientka, 2007, Electron. Notes Theor. Comput. Sci..

Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions

Amy P. Felty, Alberto Momigliano, Brigitte Pientka, 2018, Math. Struct. Comput. Sci..

Mechanizing Meta-Theory in Beluga (Invited Talk)

Brigitte Pientka, 2015, WPTE@RTA/TLCA.

Universality of Proofs (Dagstuhl Seminar 16421)

Florian Rabe, Gilles Dowek, Brigitte Pientka, 2016, Dagstuhl Reports.

First-class substitutions in contextual type theory

Brigitte Pientka, Andrew Cave, 2013, LFMTP '13.

A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming

Brigitte Pientka, 2002, ICLP.

Tabling for Higher-Order Logic Programming

Brigitte Pientka, 2005, CADE.

An insider's look at LF type reconstruction: everything you (n)ever wanted to know

Brigitte Pientka, B. Pientka, 2013, J. Funct. Program..

Contextual modal type theory

Frank Pfenning, Brigitte Pientka, Aleksandar Nanevski, 2008, TOCL.

LINCX: A Linear Logical Framework with First-Class Contexts

Brigitte Pientka, Agata Murawska, Aina Linn Georges, 2017, ESOP.

Small Proof Witnesses for LF

Karl Crary, Brigitte Pientka, Susmit Sarkar, 2005, ICLP.

Cocon: Computation in Contextual Type Theory pdf

Brigitte Pientka, Andreas Abel, David Thibodeau, 2019, ArXiv.

Programming with binders and indexed data-types

Brigitte Pientka, Andrew Cave, 2012, POPL '12.

The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations

Amy P. Felty, Alberto Momigliano, Brigitte Pientka, 2015, Journal of Automated Reasoning.

Inductive Beluga: Programming Proofs

Brigitte Pientka, Andrew Cave, 2015, CADE.

Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4

Brigitte Pientka, Samuli Heilala, B. Pientka, 2007, CADE.

A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

Brigitte Pientka, 2008, POPL '08.

Higher-Order Substitution Tree Indexing

Brigitte Pientka, 2003, ICLP.

Matrix-Based Inductive Theorem Proving

Christoph Kreitz, Brigitte Pientka, C. Kreitz, 2000, TABLEAUX.

Session details: Functional reactive programming

Brigitte Pientka, 2013, PLPV 2013.

Verifying Termination and Reduction Properties about Higher-Order Logic Programs

Brigitte Pientka, 2005, Journal of Automated Reasoning.

Optimizing Higher-Order Pattern Unification

Frank Pfenning, Brigitte Pientka, F. Pfenning, 2003, CADE.

Teaching the art of functional programming using automated grading (experience report)

Brigitte Pientka, Aliya Hameer, B. Pientka, 2019, Proc. ACM Program. Lang..

Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)

Brigitte Pientka, Joshua Dunfield, B. Pientka, 2010, IJCAR.

Structured Incremental Proof Planning

Brigitte Pientka, Stefan Gerberding, 1997, KI.

A Type Theory for Defining Logics and Proofs

Brigitte Pientka, Andreas Abel, David Thibodeau, 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks

Brigitte Pientka, 2006, ICLP.

Programming Type-Safe Transformations Using Higher-Order Abstract Syntax

Brigitte Pientka, Stefan Monnier, Olivier Savary Bélanger, 2013, CPP.

Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, LFMTP '14, Vienna, Austria, July 17, 2014

Amy P. Felty, Brigitte Pientka, 2014, LFMTP.

Instantiation of Existentially Quantied Variables in Inductive Specication Proofs

Christoph Kreitz, Brigitte Pientka, C. Kreitz, 1998 .

Matrix-based Constructive Theorem Proving

Christoph Kreitz, Jens Otten, Brigitte Pientka, 2000, Intellectics and Computational Logic.

Termination and Reduction Checking for Higher-Order Logic Programs

Brigitte Pientka, 2001, IJCAR.

Mechanizing proofs with logical relations - Kripke-style

Brigitte Pientka, Andrew Cave, 2018, Math. Struct. Comput. Sci..

Explicit Substitutions for Contextual Type Theory

Brigitte Pientka, Andreas Abel, Andreas Abel, 2010, LFMTP.

Instantiation of Existentially Quantified Variables in Inductive Specification Proofs

Christoph Kreitz, Brigitte Pientka, 1998, AISC.

Copatterns: programming infinite structures by observations

Brigitte Pientka, Andreas Abel, Anton Setzer, 2013, POPL.

Wellfounded recursion with copatterns: a unified approach to termination and productivity

Brigitte Pientka, Andreas Abel, Andreas Abel, 2013, ICFP.

An Open Challenge Problem Repository for Systems Supporting Binders

Amy P. Felty, Alberto Momigliano, Brigitte Pientka, 2015, LFMTP.

Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison

Amy P. Felty, Brigitte Pientka, 2010, ITP.

Cocon: A Type Theory for Defining Logics and Proofs (Extended Abstract): Invited Presentation at the of the Fourteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

Brigitte Pientka, 2019 .

Higher-Order Dynamic Pattern Unification for Dependent Types and Records

Brigitte Pientka, Andreas Abel, Andreas Abel, 2011, TLCA.

A modal foundation for meta-variables

Frank Pfenning, Brigitte Pientka, Aleksandar Nanevski, 2003, MERLIN '03.

Compiling contextual objects: bringing higher-order abstract syntax to programmers

Brigitte Pientka, Stefan Monnier, Francisco Ferreira, 2013, PLPV.

Index-Stratified Types (Extended Version) pdf

Brigitte Pientka, David Thibodeau, Rohan Jacob-Rao, 2018, ArXiv.

Featherweight Java: Theory and Implementation

Brigitte Pientka, Benjamin Azan, 1999 .

Intuitionistic Modal Logic and Applications (IMLA 2008)

Valeria de Paiva, Brigitte Pientka, 2011, Inf. Comput..

Logic and Computation

Brigitte Pientka, B. Pientka, 2014 .

Multi-level Contextual Type Theory

Brigitte Pientka, Mathieu Boespflug, B. Pientka, 2011, LFMTP.

Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming

Wim Vanhoof, Brigitte Pientka, 2017 .

Preface

Carsten Schürmann, Brigitte Pientka, 2008, Electron. Notes Theor. Comput. Sci..

Automating Inductive Specification Proofs

Christoph Kreitz, Brigitte Pientka, 1999, Fundam. Informaticae.

Proceedings of the Eighth ACM SIGPLAN International Workshop on Logical Frameworks & Meta-languages: Theory & Practice, LFMTP 2013, Boston, Massachusetts, USA, September 23, 2013

Alberto Momigliano, Brigitte Pientka, Randy Pollack, 2013, LFMTP.

Indexed codata types

Brigitte Pientka, Andrew Cave, David Thibodeau, 2016, ICFP.

Bidirectional Elaboration of Dependently Typed Programs

Brigitte Pientka, Francisco Ferreira, B. Pientka, 2014, PPDP '14.

A Case Study on Logical Relations using Contextual Types

Brigitte Pientka, Andrew Cave, 2015, LFMTP.

Data Collection for the Learn-OCaml Programming Platform: Modelling How Students Develop Typed Functional Programs

Xujie Si, Brigitte Pientka, Alana Ceci, 2021, SIGCSE.

Harpoon: Mechanizing Metatheory Interactively - (System Description)

Brigitte Pientka, Junyoung Jang, Jacob Errington, 2021, CADE.

Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself pdf

Brigitte Pientka, Stefan Monnier, Junyoung Jang, 2021, Proc. ACM Program. Lang..

A Unified Approach to Termination and Productivity

Brigitte Pientka, Andreas Abel, 2013 .

Programming proofs : a novel approach based on contextual types

Brigitte Pientka, 2011 .

Termination and Reduction Checking in the Logical Framework

Frank Pfenning, Brigitte Pientka, 2000 .

Structural Recursion over Contextual Objects

Brigitte Pientka, Andreas Abel, Sherry Shanshan Ruan, 2014 .