Patricia Johann

65 papers A* 7A 4B 12C 2Journal 31Unranked 8

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