Typed lambda calculus

Known as: Typed lambda calculi

A typed lambda calculus is a typed formalism that uses the lambda-symbol () to denote anonymous function abstraction. In this context, types are…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Gradual typing combines static and dynamic typing in the same program. One would hope that the performance in a gradually typed…

2014

Incremental view maintenance is an essential tool for speeding up the processing of large, locally changing workloads. Its…

2007

The paper considers algebraic directed-complete partial orders with a semi-regular Scott topology, called regular domains. As is…

1996

The module system of SML is a small typed language of its own. As is, one would expect a proof of its soundness following from a…

1996

We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin L¨of's type theory. The…

1995

1992

1991

We are concerned with two important issues in simulation modelling: model comprehension and model construction. Model…

1985

Review

1983

Review

1983

• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences…