Back to Results
First PageMeta Content
Mathematical logic / Computer science / Denotational semantics / Lambda calculus / Symbol / Combinatory logic / Orbifold / Programming Computable Functions / Theoretical computer science / Logic in computer science / Programming language semantics


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

City

Canterbury / /

Company

S S a / /

Country

United Kingdom / /

Currency

pence / USD / /

/

IndustryTerm

usual machinery / syntactic function applications / monad law / idempotence law / polymorphic type systems / /

NaturalFeature

SaLT / /

Organization

Institut f¨ur Informatik Universit¨at Bonn / Daniel Seidel† Lutz Straßburger Janis Voigtl¨ander Institut f¨ur Informatik Universit¨at Bonn / eta / Ecole Polytechnique / /

Person

Nat / Ai / Curry Minor / Janis Voigtl¨ander / Stefan Mehner / Daniel Seidel† Lutz Straßburger / /

Position

author / representative / second author / /

ProgrammingLanguage

Haskell / J / K / /

Technology

Functional programming / /

URL

http /

SocialTag