 | 2012 |
|---|
| 31 |       | Robert Atkey,
Neil Ghani,
Bart Jacobs,
Patricia Johann:
Fibrational Induction Meets Effects.
FoSSaCS 2012: 42-57 |
| 30 | | Robert Atkey,
Patricia Johann,
Neil Ghani:
Refining Inductive Types
CoRR abs/1205.2492: (2012) |
| 2011 |
|---|
| 29 | | Clément Fumex,
Neil Ghani,
Patricia Johann:
Indexed Induction and Coinduction, Fibrationally.
CALCO 2011: 176-191 |
| 28 | | Robert Atkey,
Patricia Johann,
Neil Ghani:
When Is a Type Refinement an Inductive Type?
FOSSACS 2011: 72-87 |
| 2010 |
|---|
| 27 | | Neil Ghani,
Patricia Johann,
Clément Fumex:
Fibrational Induction Rules for Initial Algebras.
CSL 2010: 336-350 |
| 26 | | Patricia Johann,
Alex Simpson,
Janis Voigtländer:
A Generic Operational Metatheory for Algebraic Effects.
LICS 2010: 209-218 |
| 2009 |
|---|
| 25 | | Patricia Johann,
Neil Ghani:
A principled approach to programming with nested types in Haskell.
Higher-Order and Symbolic Computation 22(2): 155-189 (2009) |
| 24 | | 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) |
| 2008 |
|---|
| 23 | | Patricia Johann,
Neil Ghani:
Foundations for structured programming with GADTs.
POPL 2008: 297-308 |
| 2007 |
|---|
| 22 | | Patricia Johann,
Neil Ghani:
Initial Algebra Semantics Is Enough!
TLCA 2007: 207-222 |
| 21 | | Neil Ghani,
Patricia Johann:
Monadic augment and generalised short cut fusion.
J. Funct. Program. 17(6): 731-776 (2007) |
| 20 | | Janis Voigtländer,
Patricia Johann:
Selective strictness and parametricity in structural operational semantics, inequationally.
Theor. Comput. Sci. 388(1-3): 290-318 (2007) |
| 2006 |
|---|
| 19 | | Patricia Johann,
Janis Voigtländer:
The Impact of seq on Free Theorems-Based Program Transformations.
Fundam. Inform. 69(1-2): 63-102 (2006) |
| 2005 |
|---|
| 18 | | Neil Ghani,
Patricia Johann,
Tarmo Uustalu,
Varmo Vene:
Monadic augment and generalised short cut fusion.
ICFP 2005: 294-305 |
| 17 | | 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) |
| 2004 |
|---|
| 16 | | Patricia Johann,
Janis Voigtländer:
Free theorems in the presence of seq.
POPL 2004: 99-110 |
| 2003 |
|---|
| 15 | | Walid Taha,
Patricia Johann:
Staged Notational Definitions.
GPCE 2003: 97-116 |
| 14 | | Patricia Johann:
Short cut fusion is correct.
J. Funct. Program. 13(4): 797-814 (2003) |
| 2002 |
|---|
| 13 | | Patricia Johann:
A Generalization of Short-Cut Fusion and its Correctness Proof.
Higher-Order and Symbolic Computation 15(4): 273-300 (2002) |
| 2001 |
|---|
| 12 | | Patricia Johann:
Short Cut Fusion: Proved and Improved.
SAIG 2001: 47-71 |
| 11 | | Patricia Johann,
Eelco Visser:
Fusing Logic and Control with Local Transformations: An Example Optimization.
Electr. Notes Theor. Comput. Sci. 57: 144-162 (2001) |
| 2000 |
|---|
| 10 | | 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) |
| 1999 |
|---|
| 9 | | 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) |
| 1997 |
|---|
| 8 |  | Rolf Socher-Ambrosius,
Patricia Johann:
Deduction systems.
Springer 1997: I-XII, 1-206 |
| 1995 |
|---|
| 7 | | Daniel J. Dougherty,
Patricia Johann:
A Combinatory Logic Approach to Higher-Order E-Unification.
Theor. Comput. Sci. 139(1&2): 207-242 (1995) |
| 1994 |
|---|
| 6 | | Patricia Johann,
Michael Kohlhase:
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading.
CADE 1994: 620-634 |
| 5 | | Patricia Johann,
Rolf Socher-Ambrosius:
Solving Simplification Ordering Constraints.
CCL 1994: 352-367 |
| 4 | | Patricia Johann:
Normal Forms in Combinatory Logic.
Notre Dame Journal of Formal Logic 35(4): 573-594 (1994) |
| 1992 |
|---|
| 3 | | Daniel J. Dougherty,
Patricia Johann:
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract).
CADE 1992: 79-93 |
| 2 | | Daniel J. Dougherty,
Patricia Johann:
An Improved General E-Unification Method.
J. Symb. Comput. 14(4): 303-320 (1992) |
| 1990 |
|---|
| 1 | | Daniel J. Dougherty,
Patricia Johann:
An Improved General E-Unification Method.
CADE 1990: 261-275 |
Data released under the ODC-BY 1.0 license — See also our legal information page