A Dependent Dependency Calculus (Extended Version)

01/26/2022
by   Pritam Choudhury, et al.
0

Over twenty years ago, Abadi et al. established the Dependency Core Calculus (DCC) as a general purpose framework for analyzing dependency in typed programming languages. Since then, dependency analysis has shown many practical benefits to language design: its results can help users and compilers enforce security constraints, eliminate dead code, among other applications. In this work, we present a Dependent Dependency Calculus (DDC), which extends this general idea to the setting of a dependently-typed language. We use this calculus to track both run-time and compile-time irrelevance, enabling faster type-checking and program execution.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

05/31/2021

Elegant elaboration with function invocation

We present an elegant design of the core language in a dependently-typed...
07/01/2019

Type Checking Program Code using SHACL (Extended Version)

It is a strength of graph-based data formats, like RDF, that they are ve...
09/12/2019

Towards Gradually Typed Capabilities in the Pi-Calculus

Gradual typing is an approach to integrating static and dynamic typing w...
12/11/2020

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...
11/17/2017

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...
08/07/2019

Space-Efficient Gradual Typing in Coercion-Passing Style

Herman et al. (2007, 2010) pointed out that the insertion of run-time ch...
06/13/2020

Pure Pattern Calculus à la de Bruijn

It is well-known in the field of programming languages that dealing with...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.