Interacting Safely with an Unsafe Environment

07/16/2021
by   Gilles Dowek, et al.
0

We give a presentation of Pure type systems where contexts need not be well-formed and show that this presentation is equivalent to the usual one. The main motivation for this presentation is that, when we extend Pure type systems with computation rules, like in the logical framework Dedukti, we want to declare the constants before the computation rules that are needed to check the well-typedness of their type.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2023

Simple Type Theory as a Clausal Theory

We give a presentation of Simple Type Theory as a clausal rewrite system...
research
04/22/2004

Speculation on graph computation architectures and computing via synchronization

A speculative overview of a future topic of research. The paper is a col...
research
10/30/2020

Type safety of rewrite rules in dependent types

The expressiveness of dependent type theory can be extended by identifyi...
research
05/05/2022

Adequate and computational encodings in the logical framework Dedukti

Dedukti is a very expressive logical framework which unlike most framewo...
research
01/28/2022

Dynamic pricing and discounts by means of interactive presentation systems in stationary point of sales

The main purpose of this article was to create a model and simulate the ...
research
11/28/2009

Laser Actuated Presentation System

We present here a pattern sensitive PowerPoint presentation scheme. The ...
research
07/17/2023

A framework for erased syntax and bidirectional typing

We introduce CompLF, a logical framework allowing for the definition of ...

Please sign up or login with your details

Forgot password? Click here to reset