Patricia Johann

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 18

Top Topics

Logic Programming

Top Venues

Publications

Patricia Johann, Pierre Cagne
How Functorial Are (Deep) GADTs? CoRR (2022)
Patricia Johann, Enrico Ghiorzi
(Deep) induction rules for GADTs. CPP (2022)
Patricia Johann, Pierre Cagne
Characterizing Functions Mappable over GADTs. APLAS (2022)
Patricia Johann, Enrico Ghiorzi, Daniel Jeffries
GADTs, Functoriality, Parametricity: Pick Two. CoRR (2021)
Patricia Johann, Enrico Ghiorzi, Daniel Jeffries
Parametricity for Nested Types and GADTs. CoRR (2021)
Patricia Johann, Enrico Ghiorzi, Daniel Jeffries
(Deep) Induction Rules for GADTs. CoRR (2021)
Patricia Johann, Enrico Ghiorzi, Daniel Jeffries
Parametricity for Primitive Nested Types. FoSSaCS (2021)
Patricia Johann, Enrico Ghiorzi
Parametricity for Nested Types and GADTs. Log. Methods Comput. Sci. 17 (4) (2021)
Patricia Johann
Preface. MFPS (2020)
Patricia Johann, Andrew Polonsky
Deep Induction: Induction Rules for (Truly) Nested Types. FoSSaCS (2020)
Andrew Polonsky, Patricia Johann
Local Presentability of Certain Comma Categories. Appl. Categorical Struct. 28 (1) (2020)
Patricia Johann, Andrew Polonsky
Higher-Kinded Data Types: Syntax and Semantics. LICS (2019)
Kristina Sojakova, Patricia Johann
A General Framework for Relational Parametricity. LICS (2018)
Kristina Sojakova, Patricia Johann
A General Framework for Relational Parametricity. CoRR (2018)
Patricia Johann, Andrew Polonsky
On local presentability of T/A. CoRR (2018)
Patricia Johann, Kristina Sojakova
Cubical Categories for Higher-Dimensional Parametricity. CoRR (2017)
Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt
A Productivity Checker for Logic Programming. CoRR (2016)
Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt
A Productivity Checker for Logic Programming. LOPSTR (2016)
Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy
Structural Resolution for Logic Programming. ICLP (Technical Communications) (2015)
Ekaterina Komendantskaya, Patricia Johann
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic. CoRR (2015)
Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy
Structural Resolution for Logic Programming. CoRR (2015)
Robert Atkey, Patricia Johann
Interleaving data and effects. J. Funct. Program. 25 (2015)
Neil Ghani, Patricia Johann, Fredrik Nordvall Forsberg, Federico Orsanigo, Tim Revell
Bifibrational Functorial Semantics of Parametric Polymorphism. MFPS (2015)
Robert Atkey, Neil Ghani, Patricia Johann
A relationally parametric model of dependent type theory. POPL (2014)
Robert Atkey, Patricia Johann, Andrew Kennedy
Abstraction and invariance for algebraically indexed types. POPL (2013)
Neil Ghani, Patricia Johann, Clément Fumex
Indexed Induction and Coinduction, Fibrationally. Log. Methods Comput. Sci. 9 (3) (2013)
Robert Atkey, Patricia Johann, Neil Ghani
Refining Inductive Types Log. Methods Comput. Sci. 8 (2) (2012)
Robert Atkey, Neil Ghani, Bart Jacobs, Patricia Johann
Fibrational Induction Meets Effects. FoSSaCS (2012)
Neil Ghani, Patricia Johann, Clément Fumex
Generic Fibrational Induction Log. Methods Comput. Sci. 8 (2) (2012)
Robert Atkey, Patricia Johann, Neil Ghani
When Is a Type Refinement an Inductive Type? FoSSaCS (2011)
Clément Fumex, Neil Ghani, Patricia Johann
Indexed Induction and Coinduction, Fibrationally. CALCO (2011)
Patricia Johann, Alex Simpson, Janis Voigtländer
A Generic Operational Metatheory for Algebraic Effects. LICS (2010)
Neil Ghani, Patricia Johann, Clément Fumex
Fibrational Induction Rules for Initial Algebras. CSL (2010)
Patricia Johann, Janis Voigtländer
A family of syntactic logical relations for the semantics of Haskell-like languages. Inf. Comput. 207 (2) (2009)
Patricia Johann, Neil Ghani
A principled approach to programming with nested types in Haskell. High. Order Symb. Comput. 22 (2) (2009)
Neil Ghani, Patricia Johann
Short Cut Fusion for Effects. Trends in Functional Programming (2008)
Patricia Johann, Neil Ghani
Foundations for structured programming with GADTs. POPL (2008)
Patricia Johann, Neil Ghani
Initial Algebra Semantics Is Enough! TLCA (2007)
Neil Ghani, Patricia Johann
Monadic augment and generalised short cut fusion. J. Funct. Program. 17 (6) (2007)
Janis Voigtländer, Patricia Johann
Selective strictness and parametricity in structural operational semantics, inequationally. Theor. Comput. Sci. 388 (1-3) (2007)
Patricia Johann, Janis Voigtländer
The Impact of seq on Free Theorems-Based Program Transformations. Fundam. Informaticae 69 (1-2) (2006)
Patricia Johann
On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. Math. Struct. Comput. Sci. 15 (2) (2005)
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
Monadic augment and generalised short cut fusion. ICFP (2005)
Patricia Johann, Janis Voigtländer
. POPL (2004)
Patricia Johann
Short cut fusion is correct. J. Funct. Program. 13 (4) (2003)
Walid Taha, Patricia Johann
Staged Notational Definitions. GPCE (2003)
Patricia Johann
A Generalization of Short-Cut Fusion and its Correctness Proof. High. Order Symb. Comput. 15 (4) (2002)
Patricia Johann
Short Cut Fusion: Proved and Improved. SAIG (2001)
Patricia Johann, Eelco Visser
Fusing Logic and Control with Local Transformations: An Example Optimization. Electron. Notes Theor. Comput. Sci. 57 (2001)
Patricia Johann, Franklyn A. Turbak
Lumberjack Summer Camp: A Cross-Institutional Undergraduate Research Experience in Computer Science. Comput. Sci. Educ. 11 (4) (2001)
Patricia Johann, Eelco Visser
Warm fusion in Stratego: A case study in generation of program transformation systems. Ann. Math. Artif. Intell. 29 (1-4) (2000)
Patricia Johann
Testing and enhancing a prototype program fusion engine. ACM SIGSOFT Softw. Eng. Notes 25 (1) (2000)
Patricia Johann
A funny thing happened on the way to the formula: demonstrating equality of functions and programs. ACM SIGCSE Bull. 31 (4) (1999)
Daniel J. Dougherty, Patricia Johann
A Combinatory Logic Approach to Higher-Order E-Unification. Theor. Comput. Sci. 139 (1&2) (1995)
Patricia Johann
Normal Forms in Combinatory Logic. Notre Dame J. Formal Log. 35 (4) (1994)
Patricia Johann, Rolf Socher-Ambrosius
Solving Simplification Ordering Constraints. CCL (1994)
Patricia Johann, Michael Kohlhase
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading. CADE (1994)
Daniel J. Dougherty, Patricia Johann
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract). CADE (1992)
Daniel J. Dougherty, Patricia Johann
An Improved General E-Unification Method. J. Symb. Comput. 14 (4) (1992)
Daniel J. Dougherty, Patricia Johann
An Improved General E-Unification Method. CADE (1990)