Compiling dyadic first-order specifications into map algebra
From MaRDI portal
Recommendations
- Formalizing generalized maps in Coq
- scientific article; zbMATH DE number 176490
- Towards the formal specification and verification of Maple programs
- First order compiler: A deterministic logic program synthesis algorithm
- scientific article; zbMATH DE number 517001
- On formal specification of Maple programs
- scientific article; zbMATH DE number 4064537
- A Calculus of Higher-Order Parameterization for Algebraic Specifications
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Compositional Diagrammatic First-Order Logic
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3164639 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3929034 (Why is no real title available?)
- scientific article; zbMATH DE number 42574 (Why is no real title available?)
- scientific article; zbMATH DE number 158462 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3488140 (Why is no real title available?)
- scientific article; zbMATH DE number 1028831 (Why is no real title available?)
- scientific article; zbMATH DE number 1145122 (Why is no real title available?)
- scientific article; zbMATH DE number 1507190 (Why is no real title available?)
- scientific article; zbMATH DE number 1765668 (Why is no real title available?)
- A proof system for fork algebras and its applications to reasoning in logics based on intuitionism
- An \textsc{Agg} application supporting visual reasoning
- Decidability of the theory of the natural integers with the Cantor pairing function and the successor
- Goals and benchmarks for automated map reasoning
- Handbook of Graph Grammars and Computing by Graph Transformation
- Introduction to axiomatic set theory
- Layered map reasoning: an experimental approach put to trial on sets
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
Cited in
(8)- A graphical representation of relational formulae with complementation
- An \textsc{Agg} application supporting visual reasoning
- Layered map reasoning: an experimental approach put to trial on sets
- Three-variable statements of set-pairing
- On graph reasoning
- Reasoning on relations, modalities, and sets
- Reasoning with graphs
- An efficient relational deductive system for propositional non-classical logics
This page was built for publication: Compiling dyadic first-order specifications into map algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870581)