scientific article; zbMATH DE number 1385477

zbMath0943.68086MaRDI QIDQ4720069

Ralph Matthes

Publication date: 9 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

typed termsmonotone inductive types

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Related Items (10)

Classical Logic with Mendler Induction ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Unnamed Item ⋮ Parameter-free polymorphic types ⋮ Termination checking with types ⋮ Iteration and coiteration schemes for higher-order and nested datatypes ⋮ Monotone (co)inductive types and positive fixed-point types ⋮ Least and greatest fixed points in intuitionistic natural deduction ⋮ Executable Relational Specifications of Polymorphic Type Systems Using Prolog ⋮ Martin Hofmann's Case for Non-Strictly Positive Data Types

Uses Software

• Automath

This page was built for publication: