Patrik Jansson

Patrik Jansson

Auto-generated profile, based on publicly available information

Patrik Jansson

Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1997
Verified
Conference Paper
Open access
PDF file
PJPatrik Jansson
Patrik Jansson
JJJohan Jeuring
Johan Jeuring

30 March 2012 in Journal of Functional Programming
Verified
Journal Article
Closed access
PDF file
JBJean-Philippe Bernardy
Jean-Philippe Bernardy
PJPatrik Jansson
Patrik Jansson
RPRoss Paterson
Ross Paterson
Reynolds' abstraction theorem (Reynolds, J. C. (1983) Types, abstraction and parametric polymorphism, Inf. Process. 83 (1), 513–523) shows how a typing judgement in System F can be translated into a relational statement (in second-order predicate logic) about inhabitants of the type. We obtain a similar result for pure type systems (PTSs): for any PTS used as a programming language, there is a PTS that can be used as a logic for parametricity. Types in the source PTS are translated to relations (expressed as types) in the target. Similarly, values of a given type are translated to proofs that the values satisfy the relational interpretation. We extend the result to inductive families. We also show that the assumption that every term satisfies the parametricity condition generated by its type is consistent with the generated logic.

1 January 1999 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RBRoland Backhouse
Roland Backhouse
PJPatrik Jansson
Patrik Jansson
JJJohan Jeuring
Johan Jeuring
LMLambert Meertens
Lambert Meertens

1 March 2009 in Journal of Functional Programming
Verified
Journal Article
Closed access
PDF file
SMShin-Cheng Mu
Shin-Cheng Mu
HKHsiang-Shang Ko
Hsiang-Shang Ko
PJPatrik Jansson
Patrik Jansson
Relational program derivation is the technique of stepwise refining a relational specification to a program by algebraic rules. The program thus obtained is correct by construction. Meanwhile, dependent type theory is rich enough to express various correctness properties to be verified by the type checker. We have developed a library, AoPA (Algebra of Programming in Agda), to encode relational derivations in the dependently typed programming language Agda. A program is coupled with an algebraic derivation whose correctness is guaranteed by the type system. Two non-trivial examples are presented: an optimisation problem and a derivation of quicksort in which well-founded recursion is used to model terminating hylomorphisms in a language with inductive types.

25 September 2008
Verified
Conference Paper
Open access
PDF file
ARAlexey Rodriguez
Alexey Rodriguez
JJJohan Jeuring
Johan Jeuring
PJPatrik Jansson
Patrik Jansson
AGAlex Gerdes
Alex Gerdes
OKOleg Kiselyov
Oleg Kiselyov
BOBruno C. D. S. Oliveira
Bruno C. D. S. Oliveira
Datatype-generic programming is defining functions that depend on the structure, or "shape", of datatypes. It has been around for more than 10 years, and a lot of progress has been made, in particular in the lazy functional programming language Haskell. There are more than 10 proposals for generic programming libraries or language extensions for Haskell. To compare and characterise the many generic programming libraries in a typed functional language, we introduce a set of criteria and develop a generic programming benchmark: a set of characteristic examples testing various facets of datatype-generic programming. We have implemented the benchmark for nine existing Haskell generic programming libraries and present the evaluation of the libraries. The comparison is useful for reaching a common standard for generic programming, but also for a programmer who has to choose a particular approach for datatype-generic programming. Copyright © 2008 ACM.link_to_subscribed_fulltex

11 January 2006
Verified
Conference Paper
Open access
PDF file
NDNils Anders Danielsson
Nils Anders Danielsson
JHJohn Hughes
John Hughes
PJPatrik Jansson
Patrik Jansson
JGJeremy Gibbons
Jeremy Gibbons
We justify reasoning about non-total (partial) functional languages using methods seemingly only valid for total ones; this permits `fast and loose' reasoning without actually being loose. Two languages are defined, one total and one partial, with identical syntax. The semantics of the partial language includes partial and infinite values and lifted types, including lifted function spaces. A partial equivalence relation is then defined, the domain of which is the total subset of the partial language. It is proved that if two closed terms have the same semantics in the total language, then they have related semantics in the partial language. It is also shown that the partial equivalence relation gives rise to a bicartesian closed category, which can be used to reason about values in the domain of the relation