default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatricia Johann
Person information
- affiliation: Appalachian State University, Computer Science Department, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Pierre Cagne, Patricia Johann:
Early Announcement: Parametricity for GADTs. CoRR abs/2411.00589 (2024)- 2022
- [c31]Patricia Johann, Pierre Cagne
:
Characterizing Functions Mappable over GADTs. APLAS 2022: 135-154 - [c30]Patricia Johann, Enrico Ghiorzi:
(Deep) induction rules for GADTs. CPP 2022: 324-337 - [i9]Patricia Johann, Pierre Cagne:
How Functorial Are (Deep) GADTs? CoRR abs/2203.14891 (2022) - 2021
- [j20]Patricia Johann, Enrico Ghiorzi:
Parametricity for Nested Types and GADTs. Log. Methods Comput. Sci. 17(4) (2021) - [c29]Patricia Johann, Enrico Ghiorzi, Daniel Jeffries:
Parametricity for Primitive Nested Types. FoSSaCS 2021: 324-343 - [c28]Patricia Johann, Enrico Ghiorzi, Daniel Jeffries:
GADTs, Functoriality, Parametricity: Pick Two. LSFA 2021: 77-92 - [i8]Patricia Johann, Enrico Ghiorzi, Daniel Jeffries:
Parametricity for Nested Types and GADTs. CoRR abs/2101.04819 (2021) - [i7]Patricia Johann, Enrico Ghiorzi, Daniel Jeffries:
(Deep) Induction Rules for GADTs. CoRR abs/2105.08155 (2021) - 2020
- [j19]Andrew Polonsky, Patricia Johann:
Local Presentability of Certain Comma Categories. Appl. Categorical Struct. 28(1): 135-142 (2020) - [c27]Patricia Johann, Andrew Polonsky:
Deep Induction: Induction Rules for (Truly) Nested Types. FoSSaCS 2020: 339-358 - [c26]Patricia Johann:
Preface. MFPS 2020: 1-3 - [e1]Patricia Johann:
Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2020, Online, October 1, 2020. Electronic Notes in Theoretical Computer Science 352, Elsevier 2020 [contents]
2010 – 2019
- 2019
- [c25]Patricia Johann, Andrew Polonsky:
Higher-Kinded Data Types: Syntax and Semantics. LICS 2019: 1-13 - 2018
- [c24]Kristina Sojakova, Patricia Johann:
A General Framework for Relational Parametricity. LICS 2018: 869-878 - [i6]Kristina Sojakova, Patricia Johann:
A General Framework for Relational Parametricity. CoRR abs/1805.00067 (2018) - [i5]Patricia Johann, Andrew Polonsky:
On local presentability of T/A. CoRR abs/1807.05263 (2018) - 2017
- [i4]Patricia Johann, Kristina Sojakova:
Cubical Categories for Higher-Dimensional Parametricity. CoRR abs/1701.06244 (2017) - 2016
- [c23]Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt:
A Productivity Checker for Logic Programming. LOPSTR 2016: 168-186 - [i3]Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt:
A Productivity Checker for Logic Programming. CoRR abs/1608.04415 (2016) - 2015
- [j18]Robert Atkey, Patricia Johann:
Interleaving data and effects. J. Funct. Program. 25 (2015) - [c22]Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy:
Structural Resolution for Logic Programming. ICLP (Technical Communications) 2015 - [c21]Neil Ghani, Patricia Johann, Fredrik Nordvall Forsberg, Federico Orsanigo, Tim Revell:
Bifibrational Functorial Semantics of Parametric Polymorphism. MFPS 2015: 165-181 - [i2]Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy:
Structural Resolution for Logic Programming. CoRR abs/1507.06010 (2015) - [i1]Ekaterina Komendantskaya, Patricia Johann:
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic. CoRR abs/1511.07865 (2015) - 2014
- [c20]Robert Atkey, Neil Ghani, Patricia Johann:
A relationally parametric model of dependent type theory. POPL 2014: 503-516 - 2013
- [j17]Neil Ghani, Patricia Johann, Clément Fumex:
Indexed Induction and Coinduction, Fibrationally. Log. Methods Comput. Sci. 9(3) (2013) - [c19]Robert Atkey, Patricia Johann, Andrew Kennedy:
Abstraction and invariance for algebraically indexed types. POPL 2013: 87-100 - 2012
- [j16]Robert Atkey, Patricia Johann, Neil Ghani:
Refining Inductive Types. Log. Methods Comput. Sci. 8(2) (2012) - [j15]Neil Ghani, Patricia Johann, Clément Fumex:
Generic Fibrational Induction. Log. Methods Comput. Sci. 8(2) (2012) - [c18]Robert Atkey, Neil Ghani, Bart Jacobs, Patricia Johann:
Fibrational Induction Meets Effects. FoSSaCS 2012: 42-57 - 2011
- [c17]Clément Fumex, Neil Ghani, Patricia Johann:
Indexed Induction and Coinduction, Fibrationally. CALCO 2011: 176-191 - [c16]Robert Atkey, Patricia Johann, Neil Ghani:
When Is a Type Refinement an Inductive Type? FoSSaCS 2011: 72-87 - 2010
- [c15]Neil Ghani, Patricia Johann, Clément Fumex:
Fibrational Induction Rules for Initial Algebras. CSL 2010: 336-350 - [c14]Patricia Johann, Alex Simpson, Janis Voigtländer:
A Generic Operational Metatheory for Algebraic Effects. LICS 2010: 209-218
2000 – 2009
- 2009
- [j14]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) - [j13]Patricia Johann, Neil Ghani:
A principled approach to programming with nested types in Haskell. High. Order Symb. Comput. 22(2): 155-189 (2009) - 2008
- [c13]Patricia Johann, Neil Ghani:
Foundations for structured programming with GADTs. POPL 2008: 297-308 - [c12]Neil Ghani, Patricia Johann:
Short Cut Fusion for Effects. Trends in Functional Programming 2008: 113-128 - 2007
- [j12]Neil Ghani, Patricia Johann:
Monadic augment and generalised short cut fusion. J. Funct. Program. 17(6): 731-776 (2007) - [j11]Janis Voigtländer, Patricia Johann:
Selective strictness and parametricity in structural operational semantics, inequationally. Theor. Comput. Sci. 388(1-3): 290-318 (2007) - [c11]Patricia Johann, Neil Ghani:
Initial Algebra Semantics Is Enough! TLCA 2007: 207-222 - 2006
- [j10]Patricia Johann, Janis Voigtländer:
The Impact of seq on Free Theorems-Based Program Transformations. Fundam. Informaticae 69(1-2): 63-102 (2006) - 2005
- [j9]Patricia Johann:
On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. Math. Struct. Comput. Sci. 15(2): 201-229 (2005) - [c10]Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene:
Monadic augment and generalised short cut fusion. ICFP 2005: 294-305 - 2004
- [c9]Patricia Johann, Janis Voigtländer:
Free theorems in the presence of seq. POPL 2004: 99-110 - 2003
- [j8]Patricia Johann:
Short cut fusion is correct. J. Funct. Program. 13(4): 797-814 (2003) - [c8]Walid Taha, Patricia Johann:
Staged Notational Definitions. GPCE 2003: 97-116 - 2002
- [j7]Patricia Johann:
A Generalization of Short-Cut Fusion and its Correctness Proof. High. Order Symb. Comput. 15(4): 273-300 (2002) - 2001
- [j6]Patricia Johann, Franklyn A. Turbak:
Lumberjack Summer Camp: A Cross-Institutional Undergraduate Research Experience in Computer Science. Comput. Sci. Educ. 11(4): 279-304 (2001) - [c7]Patricia Johann:
Short Cut Fusion: Proved and Improved. SAIG 2001: 47-71 - [c6]Patricia Johann, Eelco Visser:
Fusing Logic and Control with Local Transformations: An Example Optimization. WRS 2001: 144-162 - 2000
- [j5]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) - [j4]Patricia Johann:
Testing and enhancing a prototype program fusion engine. ACM SIGSOFT Softw. Eng. Notes 25(1): 60-61 (2000)
1990 – 1999
- 1999
- [c5]Patricia Johann:
A funny thing happened on the way to the formula: demonstrating equality of functions and programs. ITiCSE-WGR 1999: 32-34 - 1997
- [b1]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 - 1995
- [j3]Daniel J. Dougherty, Patricia Johann:
A Combinatory Logic Approach to Higher-Order E-Unification. Theor. Comput. Sci. 139(1&2): 207-242 (1995) - 1994
- [j2]Patricia Johann:
Normal Forms in Combinatory Logic. Notre Dame J. Formal Log. 35(4): 573-594 (1994) - [c4]Patricia Johann, Michael Kohlhase:
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading. CADE 1994: 620-634 - [c3]Patricia Johann, Rolf Socher-Ambrosius:
Solving Simplification Ordering Constraints. CCL 1994: 352-367 - 1992
- [j1]Daniel J. Dougherty, Patricia Johann:
An Improved General E-Unification Method. J. Symb. Comput. 14(4): 303-320 (1992) - [c2]Daniel J. Dougherty, Patricia Johann:
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract). CADE 1992: 79-93 - 1990
- [c1]Daniel J. Dougherty, Patricia Johann:
An Improved General E-Unification Method. CADE 1990: 261-275
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
