On specifications, theories, and models with higher types

DOI10.1016/S0019-9958(86)80027-4zbMath0591.68019MaRDI QIDQ3719801

Axel Poigné

Publication date: 1986

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

modelsspecificationstyped lambda-calculusdata type specificationcompleteness of higher type theoriesfree intensional models

Mathematics Subject Classification ID

Data structures (68P05) Combinatory logic and lambda calculus (03B40)

Related Items (18)

Algebraic semantics of rewriting terms and types ⋮ On the implementation of abstract data types by programming language constructs ⋮ Functorial theory of parameterized specifications in a general specification framework ⋮ Categorical models for non-extensional λ-calculi and combinatory logic ⋮ Polymorphic syntax definition ⋮ Logic programs with equational type specifications ⋮ Higher-order order-sorted algebras ⋮ Order-sorted algebraic specifications with higher-order functions ⋮ Domain theory in logical form ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ Universal algebra in higher types ⋮ Semantics of the typed \(\lambda\)-calculus with substitution in a cartesian closed category ⋮ Verifying an infinite systolic algorithm using third-order equational methods ⋮ A logic of recursion ⋮ A note on inconsistencies caused by fixpoints in a cartesian closed category ⋮ An algebraic generalization of Frege structures -- binding algebras ⋮ Order-sorted algebraic specifications with higher-order functions ⋮ An algebraic semantics of higher-order types with subtypes

This page was built for publication: On specifications, theories, and models with higher types