Brigitte Pientka

From MaRDI portal
Person:229739

Available identifiers

zbMath Open pientka.brigitteMaRDI QIDQ229739

List of research outcomes





PublicationDate of PublicationType
A type theory for defining logics and proofs2024-12-19Paper
Normalization by evaluation for modal dependent type theory2023-12-11Paper
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types2022-12-08Paper
Harpoon: mechanizing metatheory interactively2021-12-01Paper
https://portal.mardi4nfdi.de/entity/Q49933492021-06-15Paper
Contextual Types, Explained2021-01-21Paper
Semantical analysis of contextual types2020-09-23Paper
POPLMark reloaded: Mechanizing proofs by logical relations2020-05-26Paper
https://portal.mardi4nfdi.de/entity/Q51113172020-05-26Paper
A case study in programming coinductive proofs: Howe’s method2019-10-09Paper
Programming type-safe transformations using higher-order abstract syntax2019-09-18Paper
Mechanizing proofs with logical relations – Kripke-style2018-10-19Paper
Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions2018-10-19Paper
Well-founded recursion with copatterns and sized types2017-10-23Paper
Contextual modal type theory2017-07-12Paper
https://portal.mardi4nfdi.de/entity/Q52778452017-07-12Paper
Programs Using Syntax with First-Class Binders2017-05-19Paper
LINCX: A Linear Logical Framework with First-Class Contexts2017-05-19Paper
Indexed codata types2017-05-10Paper
The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey2016-05-26Paper
Case analysis of higher-order data2016-05-06Paper
Inductive Beluga: Programming Proofs2015-12-02Paper
Higher-order term indexing using substitution trees2015-09-17Paper
Programming with binders and indexed data-types2015-09-11Paper
Wellfounded recursion with copatterns2015-03-30Paper
Programming Type-Safe Transformations Using Higher-Order Abstract Syntax2015-01-13Paper
Copatterns2014-11-27Paper
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions2014-09-12Paper
Unnesting of Copatterns2014-07-24Paper
Fair reactive programming2014-04-10Paper
Focusing the inverse method for LF: a preliminary report2014-01-10Paper
Functional programming with higher-order abstract syntax and explicit substitutions2013-12-13Paper
An insider's look at LF type reconstruction: everything you (n)ever wanted to know2013-03-28Paper
Higher-Order Dynamic Pattern Unification for Dependent Types and Records2011-06-17Paper
Programming Inductive Proofs2010-11-22Paper
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)2010-09-14Paper
Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison2010-09-14Paper
Automated Deduction – CADE-192010-04-20Paper
Logic Programming2009-08-06Paper
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach2009-03-12Paper
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS42009-03-06Paper
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF2008-09-02Paper
Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks2008-03-11Paper
Verifying termination and reduction properties about higher-order logic programs2006-11-03Paper
Automated Deduction – CADE-202006-11-01Paper
Logic Programming2006-06-27Paper
https://portal.mardi4nfdi.de/entity/Q48129642004-08-12Paper
Connection-driven inductive theorem proving2002-09-16Paper
https://portal.mardi4nfdi.de/entity/Q45396252002-07-10Paper
https://portal.mardi4nfdi.de/entity/Q45304652002-06-03Paper
https://portal.mardi4nfdi.de/entity/Q27212032001-07-01Paper
https://portal.mardi4nfdi.de/entity/Q49341472000-01-17Paper

Research outcomes over time

This page was built for person: Brigitte Pientka