Reasoning about Object Capabilities with Logical Relations and Effect Parametricity (EuroS&P 2016, Saarbrücken) Dominique Devriese1 , Frank Piessens1 , Lars Birkedal2 1 2

Source URL: proglang.informatik.uni-freiburg.de

Translating Dependency into Parametricity Stephen Tse Steve Zdancewic University of Pennsylvania

Source URL: www.cis.upenn.edu

Notes on Logical Relations and Parametricity Jeremy G. Siek March 24, 2015 These notes are based on Derek Dreyer’s lectures at the 2015 Oregon Programming Languages Summer School. T ::= Int | Bool | String | . . . | α

Source URL: dl.dropboxusercontent.com

Parametricity-Based Reasoning about Efficiency D. Seidel∗ J. Voigtl¨ander

Source URL: www.janis-voigtlaender.eu

Parametricity for Haskell with Imprecise Error Semantics Florian Stenger1 and Janis Voigtl¨ ander Technische Universit¨ at Dresden

Source URL: www.janis-voigtlaender.eu

• Wellfoundedness
• Mathematical logic
• Mathematics
• Constructible universe
• Proof theory
• Logic
• Ordinal numbers
• CurryHoward correspondence
• Conjugate element

New Applications of Parametricity Janis Voigtl¨ander Technische Universit¨ at Dresden ISS-AiPL’09

Source URL: www.janis-voigtlaender.eu

• Software engineering
• Type theory
• Computing
• Polymorphism
• Functional programming
• Data types
• Parametricity
• Parametric polymorphism
• Map

Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel†

Source URL: www.lix.polytechnique.fr

• Theoretical computer science
• Models of computation
• Logic in computer science
• Mathematical logic
• Software engineering
• Denotational semantics
• Computability theory
• Symbol
• Proof theory
• Lambda calculus
• Generalised Whitehead product
• Programming Computable Functions

Embarrassingly Simple Generation of Free Theorems Stefan Mehner and Janis Voigtl¨ander March 26th, 2014

Source URL: www.janis-voigtlaender.eu

• Type theory
• Parametricity
• Polymorphism
• Ordinal number
• Constructible universe
• Functional programming
• Proof theory
• CurryHoward correspondence
• Net

Technische Universität Dresden Fakultät Informatik DIPLOMARBEIT Free Theorems for Sublanguages of Haskell

Source URL: www4.in.tum.de

• Type theory
• Parametricity
• Type class
• Haskell
• Polymorphism
• Map
• Lambda calculus
• Combinatory logic
• Kind
• Parametric polymorphism
• ML
• Haskell features

Internalizing Relational Parametricity in the Extensional Calculus of Constructions (Technical Appendix) Neelakantan R. Krishnaswami Derek Dreyer April 2013

Source URL: www.mpi-sws.org