Patricia Johann

Robert Atkey, Patricia Johann, Andrew Kennedy: Abstraction and invariance for algebraically indexed types. POPL 2013: 87-100

Robert Atkey, Patricia Johann, Neil Ghani: Refining Inductive Types. Logical Methods in Computer Science 8(2) (2012)

Neil Ghani, Patricia Johann, Clément Fumex: Generic Fibrational Induction. Logical Methods in Computer Science 8(2) (2012)

Robert Atkey, Neil Ghani, Bart Jacobs, Patricia Johann: Fibrational Induction Meets Effects. FoSSaCS 2012: 42-57

Clément Fumex, Neil Ghani, Patricia Johann: Indexed Induction and Coinduction, Fibrationally. CALCO 2011: 176-191

Robert Atkey, Patricia Johann, Neil Ghani: When Is a Type Refinement an Inductive Type? FOSSACS 2011: 72-87

Neil Ghani, Patricia Johann, Clément Fumex: Fibrational Induction Rules for Initial Algebras. CSL 2010: 336-350

Patricia Johann, Alex Simpson, Janis Voigtländer: A Generic Operational Metatheory for Algebraic Effects. LICS 2010: 209-218

Patricia Johann, Janis Voigtländer: A family of syntactic logical relations for the semantics of Haskell-like languages. Inf. Comput. 207(2): 341-368 (2009)

Patricia Johann, Neil Ghani: A principled approach to programming with nested types in Haskell. Higher-Order and Symbolic Computation 22(2): 155-189 (2009)

Patricia Johann, Neil Ghani: Foundations for structured programming with GADTs. POPL 2008: 297-308

Neil Ghani, Patricia Johann: Monadic augment and generalised short cut fusion. J. Funct. Program. 17(6): 731-776 (2007)

Janis Voigtländer, Patricia Johann: Selective strictness and parametricity in structural operational semantics, inequationally. Theor. Comput. Sci. 388(1-3): 290-318 (2007)

Patricia Johann, Neil Ghani: Initial Algebra Semantics Is Enough! TLCA 2007: 207-222

Patricia Johann, Janis Voigtländer: The Impact of seq on Free Theorems-Based Program Transformations. Fundam. Inform. 69(1-2): 63-102 (2006)

Patricia Johann: On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. Mathematical Structures in Computer Science 15(2): 201-229 (2005)

Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene: Monadic augment and generalised short cut fusion. ICFP 2005: 294-305

Patricia Johann, Janis Voigtländer: Free theorems in the presence of seq. POPL 2004: 99-110

Patricia Johann: Short cut fusion is correct. J. Funct. Program. 13(4): 797-814 (2003)

Walid Taha, Patricia Johann: Staged Notational Definitions. GPCE 2003: 97-116

Patricia Johann: A Generalization of Short-Cut Fusion and its Correctness Proof. Higher-Order and Symbolic Computation 15(4): 273-300 (2002)

Patricia Johann, Eelco Visser: Fusing Logic and Control with Local Transformations: An Example Optimization. Electr. Notes Theor. Comput. Sci. 57: 144-162 (2001)

Patricia Johann: Short Cut Fusion: Proved and Improved. SAIG 2001: 47-71

Patricia Johann, Eelco Visser: Warm fusion in Stratego: A case study in generation of program transformation systems. Ann. Math. Artif. Intell. 29(1-4): 1-34 (2000)

Patricia Johann: Testing and enhancing a prototype program fusion engine. ACM SIGSOFT Software Engineering Notes 25(1): 60-61 (2000)

Patricia Johann: A funny thing happened on the way to the formula: demonstrating equality of functions and programs. SIGCSE Bulletin 31(4): 32-34 (1999)

Rolf Socher-Ambrosius, Patricia Johann: Deduction systems. Graduate texts in computer science, Springer 1997, isbn 978-0-387-94847-8, pp. I-XII, 1-206

Daniel J. Dougherty, Patricia Johann: A Combinatory Logic Approach to Higher-Order E-Unification. Theor. Comput. Sci. 139(1&2): 207-242 (1995)

Patricia Johann: Normal Forms in Combinatory Logic. Notre Dame Journal of Formal Logic 35(4): 573-594 (1994)

Patricia Johann, Michael Kohlhase: Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading. CADE 1994: 620-634

Patricia Johann, Rolf Socher-Ambrosius: Solving Simplification Ordering Constraints. CCL 1994: 352-367

Daniel J. Dougherty, Patricia Johann: An Improved General E-Unification Method. J. Symb. Comput. 14(4): 303-320 (1992)

Daniel J. Dougherty, Patricia Johann: A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract). CADE 1992: 79-93

Daniel J. Dougherty, Patricia Johann: An Improved General E-Unification Method. CADE 1990: 261-275