scientific article

zbMath0585.68047MaRDI QIDQ3709890

Mario Coppo

Publication date: 1985

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

zbMATH Keywords

functional languagealgorithm to decide semantic equalitysemantics of typestype-free domain

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Related Items (9)

Recursion over realizability structures ⋮ Inheritance as implicit coercion ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Recursive types for Fun ⋮ Toward a semantics for the QUEST language ⋮ A theory for program and data type specification ⋮ Type inference with recursive types: Syntax and semantics ⋮ Combining type disciplines ⋮ A coinductive completeness proof for the equivalence of recursive types

This page was built for publication: