scientific article; zbMATH DE number 1183236

MaRDI QIDQ3837984zbMATH OpenFDO

Authors

Publication date 2 August 1998

zbMATH Keywords

inference systemoperational interpretationsubtyping

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 2185708
• Regular expression containment, coinductive axiomatization and computational interpretation
• Subtyping, declaratively. An exercise in mixed induction and coinduction
• scientific article; zbMATH DE number 7037626
• Generalizing inference systems by coaxioms

Cited in

(33)

• A coinductive completeness proof for the equivalence of recursive types
• Type soundness for path polymorphism
• Typed path polymorphism
• Logic of subtyping
• A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
• A mechanized theory of regular trees in dependent type theory
• Equational axiomatization of bicoercibility for polymorphic types
• Generalizing inference systems by coaxioms
• scientific article; zbMATH DE number 2185708 (Why is no real title available?)
• Reversible client/server interactions
• The recursive union of some gradual types
• Orchestrated session compliance
• Structural subtyping for inductive types with functorial equality rules
• Subtyping, declaratively. An exercise in mixed induction and coinduction
• Type Inference by Coinductive Logic Programming
• scientific article; zbMATH DE number 1497869 (Why is no real title available?)
• Efficient type checking for path polymorphism
• A Computational Interpretation of Context-Free Expressions
• \textbf{Actris 2.0}: asynchronous session-type based reasoning in separation logic
• Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas
• scientific article; zbMATH DE number 7168147 (Why is no real title available?)
• General Recursion via Coinductive Types
• Practical coinduction
• Regular expression containment, coinductive axiomatization and computational interpretation
• Checking Emptiness of Non-Deterministic Regular Types with Set Operators
• Decidability properties of recursive types.
• A logical framework with higher-order rational (circular) terms
• A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
• Polarized subtyping
• System \(F^\mu_\omega\) with context-free session types
• Subtyping context-free session types
• Subtyping context-free session types
• Recursive subtyping for all

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837984)