Syntax and Semantics of Cedille

06/12/2018
by   Aaron Stump, et al.
0

This document presents the syntax, classification rules, realizability semantics, and soundness theorem for Cedille, an extrinsic (i.e., Curry-style) type theory extending the Calculus of Constructions, and designed for deriving of inductive datatypes, with their induction principles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2018

Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution

We present a full formalization in Martin-Löf's Constructive Type Theory...
research
10/24/2019

A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille

Cedille is a relatively recent tool based on a Curry-style pure type the...
research
07/28/2022

Nominal Matching Logic

We introduce Nominal Matching Logic (NML) as an extension of Matching Lo...
research
03/02/2022

Characteristics of de Bruijn's early proof checker Automath

The `mathematical language' Automath, conceived by N.G. de Bruijn in 196...
research
01/14/2020

The geometry of syntax and semantics for directed file transformations

We introduce a conceptual framework that associates syntax and semantics...
research
03/27/2013

The Rational and Computational Scope of Probabilistic Rule-Based Expert Systems

Belief updating schemes in artificial intelligence may be viewed as thre...
research
05/02/2023

Allegories of Symbolic Manipulations

Moving from the mathematical theory of (abstract) syntax, we develop a g...

Please sign up or login with your details

Forgot password? Click here to reset