Elegant elaboration with function invocation

05/31/2021
by   Tesla Zhang, et al.
0

We present an elegant design of the core language in a dependently-typed lambda calculus with δ-reduction and an elaboration algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2021

A Braided Lambda Calculus

We present an untyped linear lambda calculus with braids, the correspond...
research
11/02/2021

A strong call-by-need calculus

We present a call-by-need λ-calculus that enables strong reduction (that...
research
07/30/2020

A Core Calculus for Static Latency Tracking with Placement Types

Developing efficient geo-distributed applications is challenging as prog...
research
04/20/2021

On reduction and normalization in the computational core

We study the reduction in a lambda-calculus derived from Moggi's computa...
research
05/28/2020

Explicit Effect Subtyping

As popularity of algebraic effects and handlers increases, so does a dem...
research
10/20/2017

An impure solution to the problem of matching fans

We present an algorithm to solve the problem of matching fans in interac...
research
01/26/2022

A Dependent Dependency Calculus (Extended Version)

Over twenty years ago, Abadi et al. established the Dependency Core Calc...

Please sign up or login with your details

Forgot password? Click here to reset