Matching logic explained

DOI10.1016/J.JLAMP.2021.100638OpenAlexW3082019786MaRDI QIDQ2035650FDOQ2035650

Yanyan Li

Publication date: 25 June 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/107794

zbMATH Keywords

dependent typesmatching logicprogram logics(co)inductive data types(co)monad specificationspecification of transition systems

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nominal logic, a first order theory of names and binding
• A lattice-theoretical fixpoint theorem and its applications
• A calculus of communicating systems
• Process Algebra
• Circular Coinduction: A Proof Theoretical Foundation
• Comonadic notions of computation
• Matching Logic

Cited In (4)

• Towards a unifying logical framework for neural networks
• Interactive matching logic proofs in Coq
• A matching logic foundation for Alk
• Capturing constrained constructor patterns in matching logic

Uses Software

• CIRC

This page was built for publication: Matching logic explained

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