The following pages link to (Q4331824):
Displaying 50 items.
- ``Keep definition, change category'' -- a practical approach to state-based system calculi (Q299180) (← links)
- A coalgebraic perspective on logical interpretations (Q368477) (← links)
- Towards ``mouldable code'' via nested code graph transformation (Q406453) (← links)
- A relation-algebraic approach to the ``Hoare logic'' of functional dependencies (Q406457) (← links)
- An algebraic approach to multirelations and their properties (Q516032) (← links)
- Transformation of structure-shy programs with application to XPath queries and strategic functions (Q532417) (← links)
- Dedekind categories with cutoff operators (Q549312) (← links)
- Imperative abstractions for functional actions (Q604455) (← links)
- Determinisation of relational substitutions in ordered categories with domain (Q604457) (← links)
- Cardinality functions in allegories (Q604458) (← links)
- Map fusion for nested datatypes in intensional type theory (Q627204) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- Hume box calculus: Robust system development through software transformation (Q656858) (← links)
- Genetic programming \(+\) proof search \(=\) automatic improvement (Q682376) (← links)
- A formalisation of the copy-modify-merge approach to version control in MDE (Q710677) (← links)
- Algebras, polynomials and programs (Q802882) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- Transposing partial components--an exercise on coalgebraic refinement (Q854163) (← links)
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types (Q929967) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Essential concepts of algebraic specification and program development (Q1377322) (← links)
- Programming from metaphorisms (Q1683699) (← links)
- A short cut to optimal sequences (Q1758658) (← links)
- Iteration and coiteration schemes for higher-order and nested datatypes (Q1770412) (← links)
- Finite quasivarieties and self-referential conditions (Q1770617) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- Shortcut fusion rules for the derivation of circular and higher-order programs (Q1929359) (← links)
- Typing theorems of omega algebra (Q1931900) (← links)
- Programming from Galois connections (Q1931902) (← links)
- Towards a linear algebra of programming (Q1941862) (← links)
- A calculus for generic, QoS-aware component composition (Q1949090) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Declarative pearl: deriving monadic quicksort (Q2039941) (← links)
- Sufficient and necessary conditions for solution finding in valuation-based systems (Q2302788) (← links)
- Point axioms and related conditions in Dedekind categories (Q2347908) (← links)
- A linear algebra approach to OLAP (Q2355381) (← links)
- Kleisli, Parikh and Peleg compositions and liftings for multirelations (Q2360654) (← links)
- Why mathematics needs engineering (Q2374304) (← links)
- Formal derivation of greedy algorithms from relational specifications: a tutorial (Q2374306) (← links)
- Kernels, in a nutshell (Q2374308) (← links)
- A perspective on service orchestration (Q2389337) (← links)
- Normal forms for binary relations (Q2503327) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS (Q2744176) (← links)
- Incremental Computing with Abstract Data Structures (Q2798280) (← links)
- A local graph-rewriting system for deciding equality in sum-product theories (Q2867904) (← links)
- An exercise on transition systems (Q2873687) (← links)
- An Algebraic Calculus of Database Preferences (Q2908570) (← links)
