Native Type Theory

02/09/2021
by   Christian Williams, et al.
0

We present a method to construct "native" type systems for a broad class of languages, in which types are built from term constructors by predicate logic and dependent types. Any language with products and functions can be modelled as a higher-order algebraic theory with rewrites, and the internal language of its presheaf topos provides total specification of the structure and behavior of terms. This construction is functorial, so translations of languages give translations of type systems. The construction therefore provides a shared framework of higher-order reasoning for most existing programming languages.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2023

Separated and Shared Effects in Higher-Order Languages

Effectful programs interact in ways that go beyond simple input-output, ...
research
04/10/2023

Defunctionalization with Dependent Types

The defunctionalization translation that eliminates higher-order functio...
research
10/03/2022

Reflections on existential types

Existential types are reconstructed in terms of small reflective subuniv...
research
03/03/2020

Sealing Pointer-Based Optimizations Behind Pure Functions

Functional programming languages are particularly well-suited for buildi...
research
09/11/2016

On the Similarities Between Native, Non-native and Translated Texts

We present a computational analysis of three language varieties: native,...
research
02/25/2011

Universal Higher Order Grammar

We examine the class of languages that can be defined entirely in terms ...
research
12/04/2017

Layer by layer - Combining Monads

We develop a method to incrementally construct programming languages. Ou...

Please sign up or login with your details

Forgot password? Click here to reset