A Dependent Dependency Calculus (Extended Version)

by   Pritam Choudhury, et al.

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.



page 1

page 2

page 3

page 4


Elegant elaboration with function invocation

We present an elegant design of the core language in a dependently-typed...

Type Checking Program Code using SHACL (Extended Version)

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

Towards Gradually Typed Capabilities in the Pi-Calculus

Gradual typing is an approach to integrating static and dynamic typing w...

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...

Space-Efficient Gradual Typing in Coercion-Passing Style

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

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.