Galois Connections for Recursive Types

DOI10.1007/978-3-030-41103-9_4zbMath1440.68042OpenAlexW3006303566MaRDI QIDQ3297839

No author found.

Publication date: 20 July 2020

Published in: From Lambda Calculus to Cybersecurity Through Program Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-41103-9_4

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Uses Software

• Agda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The tensor product in Wadler's analysis of lists
• Containers: Constructing strictly positive types
• A lattice-theoretical fixpoint theorem and its applications
• Reduced Product Combination of Abstract Domains for Shapes
• Relational inductive shape analysis
• Domain-Theoretic Foundations of Functional Programming
• A Calculational Approach to Control-Flow Analysis by Abstract Interpretation
• Dependently Typed Programming in Agda
• Category Theory

This page was built for publication: Galois Connections for Recursive Types