Galois Connections for Recursive Types
From MaRDI portal
Galois correspondences, closure operators (in relation to ordered sets) (06A15) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)
Recommendations
- Galois connections in categorial type logic
- scientific article; zbMATH DE number 956833
- An algebraic view on recursive types
- Galois connections for bilattices
- Typed Lambda Calculi and Applications
- A Galois connection calculus for abstract interpretation
- scientific article; zbMATH DE number 1420784
- General Recursion via Coinductive Types
- scientific article; zbMATH DE number 2003149
- Programming from Galois connections
Cites work
- A Calculational Approach to Control-Flow Analysis by Abstract Interpretation
- A lattice-theoretical fixpoint theorem and its applications
- Category Theory
- Containers: Constructing strictly positive types
- Dependently typed programming in Agda
- Domain-Theoretic Foundations of Functional Programming
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- scientific article; zbMATH DE number 2087567 (Why is no real title available?)
- scientific article; zbMATH DE number 1390341 (Why is no real title available?)
- Reduced product combination of abstract domains for shapes
- Relational inductive shape analysis
- The tensor product in Wadler's analysis of lists
Cited in
(5)
This page was built for publication: Galois Connections for Recursive Types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297839)