Travelled to:
1 × Czech Republic
1 × Ireland
1 × United Kingdom
2 × Estonia
2 × France
2 × Germany
3 × Italy
3 × USA
Collaborated with:
N.Ghani R.Atkey D.J.Dougherty J.Voigtländer W.Taha ∅ M.Kohlhase E.Komendantskaya V.Komendantskiy A.Kennedy C.Fumex A.Simpson B.Jacobs T.Uustalu V.Vene
Talks about:
algebra (4) type (4) induct (3) unif (3) structur (2) program (2) improv (2) fusion (2) fibrat (2) effect (2)
Person: Patricia Johann
DBLP: Johann:Patricia
Contributed to:
Wrote 16 papers:
- ICLP-2015-JohannKK #logic programming
- Structural Resolution for Logic Programming (PJ, EK, VK), pp. 87–99.
- POPL-2014-AtkeyGJ #dependent type #parametricity #type system
- A relationally parametric model of dependent type theory (RA, NG, PJ), pp. 503–516.
- POPL-2013-AtkeyJK #abstraction #algebra
- Abstraction and invariance for algebraically indexed types (RA, PJ, AK), pp. 87–100.
- FoSSaCS-2012-AtkeyGJJ #induction
- Fibrational Induction Meets Effects (RA, NG, BJ, PJ), pp. 42–57.
- FoSSaCS-2011-AtkeyJG #induction #question #refinement
- When Is a Type Refinement an Inductive Type? (RA, PJ, NG), pp. 72–87.
- CSL-2010-GhaniJF #algebra #induction
- Fibrational Induction Rules for Initial Algebras (NG, PJ, CF), pp. 336–350.
- LICS-2010-JohannSV #algebra
- A Generic Operational Metatheory for Algebraic Effects (PJ, AS, JV), pp. 209–218.
- POPL-2008-JohannG #data type #programming
- Foundations for structured programming with GADTs (PJ, NG), pp. 297–308.
- TLCA-2007-JohannG #algebra #exclamation #semantics
- Initial Algebra Semantics Is Enough! (PJ, NG), pp. 207–222.
- ICFP-2005-GhaniJUV #monad
- Monadic augment and generalised short cut fusion (NG, PJ, TU, VV), pp. 294–305.
- POPL-2004-JohannV #theorem
- Free theorems in the presence of seq (PJ, JV), pp. 99–110.
- GPCE-2003-TahaJ #staged
- Staged Notational Definitions (WT, PJ), pp. 97–116.
- SAIG-2001-Johann
- Short Cut Fusion: Proved and Improved (PJ), pp. 47–71.
- CADE-1994-JohannK #constant #order #unification #λ-calculus
- Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading (PJ, MK), pp. 620–634.
- CADE-1992-DoughertyJ #approach #combinator #higher-order #logic
- A Combinatory Logic Approach to Higher-order E-unification (DJD, PJ), pp. 79–93.
- CADE-1990-DoughertyJ
- An Improved General E-Unification Method (DJD, PJ), pp. 261–275.