Back to Results
First PageMeta Content
Type theory / Logic in computer science / Deduction / Mathematical constructivism / Realizability / Entailment / Parametricity / Symbol / Lambda calculus / Logic / Mathematical logic / Mathematics


Realizability and Parametricity in Pure Type Systems Jean-Philippe Bernardy1 and Marc Lasson2 1 2
Add to Reading List

Document Date: 2014-03-04 08:28:39

Open Document

File Size: 344,27 KB

Share Result on Facebook

City

Lyon / /

Company

Pure Type Systems / /

Facility

Chalmers University of Technology / University of Gothenburg ENS Lyon / /

IndustryTerm

intuitionistic systems / pure types systems / even inconsistent systems / type systems / /

Organization

U.S. Securities and Exchange Commission / Chalmers University of Technology / University of Gothenburg ENS Lyon / /

Person

Nat / Van Oosten / Ai / /

Position

Coq proof assistant / /

ProgrammingLanguage

Haskell / Objective Caml / R / /

SocialTag