scientific article
From MaRDI portal
Publication:3837984
zbMath0902.68105MaRDI QIDQ3837984
No author found.
Publication date: 2 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (17)
A Computational Interpretation of Context-Free Expressions ⋮ Reversible client/server interactions ⋮ The Recursive Union of Some Gradual Types ⋮ Orchestrated session compliance ⋮ A Mechanized Theory of Regular Trees in Dependent Type Theory ⋮ A logical framework with higher-order rational (circular) terms ⋮ Typed path polymorphism ⋮ A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ Polarized subtyping ⋮ Practical coinduction ⋮ Type soundness for path polymorphism ⋮ Checking Emptiness of Non-Deterministic Regular Types with Set Operators ⋮ Logic of subtyping ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Type Inference by Coinductive Logic Programming ⋮ A coinductive completeness proof for the equivalence of recursive types
This page was built for publication:
