#### Filter Results:

- Full text PDF available (34)

#### Publication Year

1985

2018

- This year (2)
- Last 5 years (10)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Patricia Johann, Neil Ghani
- POPL
- 2008

GADTs are at the cutting edge of functional programming and becomemore widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In this paper we solveâ€¦ (More)

- Patricia Johann, Janis VoigtlÃ¤nder
- POPL
- 2004

Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free.â€¦ (More)

- Patricia Johann
- Higher-Order and Symbolic Computation
- 2002

Short-cut fusion is a program transformation technique that uses a single, local transformationâ€”called the foldr-build ruleâ€”to remove certain intermediate lists from modularly constructed functionalâ€¦ (More)

- Patricia Johann
- J. Funct. Program.
- 2003

Fusion is the process of improving the efficiency of modularly constructed programs by transforming them into monolithic equivalents. This paper defines a generalization of the standard buildâ€¦ (More)

- Robert Atkey, Patricia Johann, Neil Ghani
- Logical Methods in Computer Science
- 2012

Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refineâ€¦ (More)

- Daniel J. Dougherty, Patricia Johann
- CADE
- 1990

A generalization of Paramodulation is deened and shown to lead to a complete E-uniication method for arbitrary equational theories E. The method is deened in terms of transformations on systems,â€¦ (More)

- Patricia Johann, Janis VoigtlÃ¤nder
- Fundam. Inform.
- 2006

Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free.â€¦ (More)

- Robert Atkey, Neil Ghani, Patricia Johann
- POPL
- 2014

Reynolds' theory of relational parametricity captures the invariance of polymorphically typed programs under change of data representation. Reynolds' original work exploited the typing discipline ofâ€¦ (More)

- Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
- ICFP
- 2005

Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monadic programmingâ€¦ (More)