Brigitte Pientka
Title
Cited by
Cited by
Year
Contextual modal type theory
A Nanevski, F Pfenning, B Pientka
ACM Transactions on Computational Logic 9 (3), 1-49, 2008
2952008
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
B Pientka
ACM SIGPLAN Notices 43 (1), 371-382, 2008
1412008
Beluga: A framework for programming and reasoning with deductive systems (system description)
B Pientka, J Dunfield
International Joint Conference on Automated Reasoning, 15-21, 2010
1392010
Copatterns: programming infinite structures by observations
A Abel, B Pientka, D Thibodeau, A Setzer
ACM SIGPLAN Notices 48 (1), 27-38, 2013
1312013
Wellfounded recursion with copatterns: A unified approach to termination and productivity
AM Abel, B Pientka
ACM SIGPLAN Notices 48 (9), 185-196, 2013
942013
Programming with proofs and explicit contexts
B Pientka, J Dunfield
Proceedings of the 10th international ACM SIGPLAN conference on Principles …, 2008
862008
Fair reactive programming
A Cave, F Ferreira, P Panangaden, B Pientka
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014
75*2014
Programming with binders and indexed data-types
A Cave, B Pientka
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2012
532012
Optimizing higher-order pattern unification
B Pientka, F Pfenning
International Conference on Automated Deduction, 473-487, 2003
412003
Higher-order dynamic pattern unification for dependent types and records
A Abel, B Pientka
International Conference on Typed Lambda Calculi and Applications, 10-26, 2011
392011
Tabled higher-order logic programming
B Pientka
CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, 2003
362003
Inductive beluga: Programming proofs
B Pientka, A Cave
International Conference on Automated Deduction, 272-281, 2015
352015
Well-founded recursion with copatterns and sized types
A Abel, B Pientka
Journal of Functional Programming 26, 2016
332016
Beluga: Programming with dependent types, contextual data, and contexts
B Pientka
International Symposium on Functional and Logic Programming, 1-12, 2010
292010
The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations
AP Felty, A Momigliano, B Pientka
Journal of Automated Reasoning 55 (4), 307-372, 2015
282015
Reasoning with higher-order abstract syntax and contexts: A comparison
A Felty, B Pientka
International Conference on Interactive Theorem Proving, 227-242, 2010
252010
An insider’s look at LF type reconstruction: Everything you (n) ever wanted to know
B Pientka
242010
Case analysis of higher-order data
J Dunfield, B Pientka
Electronic Notes in Theoretical Computer Science 228, 69-84, 2009
242009
Proof pearl: The power of higher-order encodings in the logical framework LF
B Pientka
International Conference on Theorem Proving in Higher Order Logics, 246-261, 2007
232007
Verifying termination and reduction properties about higher-order logic programs
B Pientka
Journal of Automated Reasoning 34 (2), 179-207, 2005
232005
The system can't perform the operation now. Try again later.
Articles 1–20