1998•HAL (Le Centre pour la Communication Scientifique Directe)Open access

A CPS-semantics for a typed lambda-calculus of exception handling with fixed-point

Catherine Pilière

Open full text 0 citations

Abstract

Colloque avec actes et comité de lecture.

About this research paper

What this paper is about

Colloque avec actes et comité de lecture.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Colloque avec actes et comité de lecture.

Key concepts: Combinatory logic, Simply typed lambda calculus, Lambda calculus, Typed lambda calculus, System F, Normalisation by evaluation, Calculus (dental), Fixed point

Back to paper search Browse research topics Original source

A CPS-semantics for a typed lambda-calculus of exception handling with fixed-point — Research Paper | ScholarLens

A CPS-semantics for a typed lambda-calculus of exception handling with fixed-point

About this research paper

What this paper is about

Why it matters

Key contribution

Method / approach

Main findings

Limitations

Applications

Available abstract

Related papers