scientific article; zbMATH DE number 7163280

zbMath1442.68031arXiv1802.00061MaRDI QIDQ5214814

Daniel R. Licata, Max New

Publication date: 5 February 2020

Full work available at URL: https://arxiv.org/abs/1802.00061

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

category theorydenotational semanticstype systemsgradual typingprogram logics

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50)

Related Items (3)

Unnamed Item ⋮ Galois connecting call-by-value and call-by-name ⋮ Gradual type theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Fixed-point constructions in order-enriched categories
• Dynamic typing: Syntax and proof theory
• Relational properties of domains
• A judgmental reconstruction of modal logic
• Dependent Types and Fibred Computational Effects
• A theory of gradual effect systems
• Abstracting gradual typing
• Contracts for higher-order functions
• The design and implementation of typed scheme
• Well-Typed Programs Can’t Be Blamed
• Framed bicategories and monoidal fibrations
• The Category-Theoretic Solution of Recursive Domain Equations
• Data Types as Lattices
• Parametricity and local variables
• Foundations of dependent interoperability
• A unified framework for generalized multicategories
• Threesomes, with and without blame
• Gradual refinement types
• Automatically generating the dynamic semantics of gradually typed languages
• Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
• Bifibrational functorial semantics of parametric polymorphism

This page was built for publication: