Rosolini, Giuseppe

Simpson, Alex

English

We present a simple and workable axiomatization of domain theory within intuitionistic set theory, in which predomains are (special) sets, and domains are algebras for a simple equational theory. We use the axioms to construct a relationally parametric set-theoretic model for a compact but powerful polymorphic programming language, given by a novel extension of intuitionistic linear type theory based on strictness. By applying the model, we establish the fundamental operational properties of the language. 1

Edinburgh Research Explorer

A note on logical relations between semantics and syntax.

A small complete category.

A uniform account of domain theory in realizability models.

Complete axioms for categorical ﬁxed-point operators.

Computational adequacy for recursive types in models of intuitionistic set theory.

Computational adequacy in an elementary topos.

Computational effects and operations: an overview.

Continuity and Effectivity in Topoi.

Effective domains and intrinsic structure.

First steps in synthetic domain theory.

Functorial Parametricity.

General synthetic domain theory — a logical approach.

How complete is PER?

Intuitionistic set theory.

On the adequacy of PER models.

Operational properties of Lily, a polymorphic linear lambda calculus with recursion.

Proofs and Types.

Reﬂexive graphs and parametric polymorphism.

Relating theories of the λ-calculus.

The discrete objects in the effective topos.

Two reults on set-theoretic polymorphism.

Type theory and recursion.

Types, abstraction and parametric polymorphism.

Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness

Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer