Formalization of the polymorphic lambda calculus and its parametricity theorem
-
Updated
May 2, 2019 - Coq
Formalization of the polymorphic lambda calculus and its parametricity theorem
A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.
language verification, construction, and analysis
Denotational semantics for the masses
Записки по курса ,,Семантика на езиците за програмиране"
Ph.D dissertation website
Using the techniques of denotational design for modular arithmetic
An interpreter for Denotational Semantics of While language
Strong normalization and parametricity for System Fω in Coq
Programming Languages
Another functional library. Detonational syntax lazy evaluation, eager evaluation, and for the reactive model.
SPCF: Interpreter Development and Affine Program Transformation Showcase
SPCF: Interpreter Development and Affine Program Transformation Showcase
Add a description, image, and links to the denotational-semantics topic page so that developers can more easily learn about it.
To associate your repository with the denotational-semantics topic, visit your repo's landing page and select "manage topics."