Back to Results
First PageMeta Content
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


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

Document Date: 2014-12-08 09:42:38

Open Document

File Size: 304,47 KB

Share Result on Facebook
UPDATE