scientific article
From MaRDI portal
Publication:3839066
zbMath0922.03021MaRDI QIDQ3839066
Roberto M. Amadio, Solange Coupet-Grimal
Publication date: 11 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
type theorytotalitysimply typed lambda-calculusinfinite objectsconstructorsco-inductive typesguard conditionp.e.r. semantics
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (8)
Size-based termination of higher-order rewriting ⋮ Mixed Inductive/Coinductive Types and Strong Normalization ⋮ Is sized typing for Coq practical? ⋮ Well-founded recursion with copatterns and sized types ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ Termination checking with types ⋮ Compositional Coinduction with Sized Types
This page was built for publication:
