Work

A termination proof of reduction in a simply typed calculus with constructors

Year: 2011

Type: report

Abstract: . The well-known proof of termination of reduction in simply typed calculi is adapted to a monomorphically typed lambda-calculus with case and constructors and recursive data types. The proof differs at several places from the standard proof. Perhaps it is useful and can be extended also to more complex calculi 1

Source: Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt)

Author: Manfred Schmidt-Schauß

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2872575715

Cites: 1

Cited by: 2

Related to: 10