( en | de | ru )

 

Disambiguation of "Pientka, Brigitte"

Author of the publication

copydeleteadd this publication to your clipboard
Mechanizing Proofs about Mendler-style Recursion.

, , and . LFMTP, page 1:1-1:9. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christine Pientka

Ludger Pientka

Romuald Pientka

Monika Pientka

Falko Pientka

 

Other publications of authors with the same name

Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself., , , and . Proc. ACM Program. Lang., 6 (POPL): 1-27 (2022)Mechanizing Proofs about Mendler-style Recursion., , and . LFMTP, page 1:1-1:9. ACM, (2016)Verifying Termination and Reduction Properties about Higher-Order Logic Programs.. J. Autom. Reason., 34 (2): 179-207 (2005)Instantiation of Existentially Quantified Variables in Inductive Specification Proofs., and . AISC, volume 1476 of Lecture Notes in Computer Science, page 247-258. Springer, (1998)Optimizing Higher-Order Pattern Unification., and . CADE, volume 2741 of Lecture Notes in Computer Science, page 473-487. Springer, (2003)Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison., and . ITP, volume 6172 of Lecture Notes in Computer Science, page 227-242. Springer, (2010)Programs Using Syntax with First-Class Binders., and . ESOP, volume 10201 of Lecture Notes in Computer Science, page 504-529. Springer, (2017)Index-Stratified Types (Extended Version)., , and . CoRR, (2018)A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions.. POPL, page 371-382. ACM, (2008)POPLMark reloaded: Mechanizing proofs by logical relations., , , , , , and . J. Funct. Program., (2019)