scientific article; zbMATH DE number 977284
From MaRDI portal
Publication:4331824
Cited in
(only showing first 100 items - show all)- On the algebraic structure of declarative programming languages
- Essential concepts of algebraic specification and program development
- Programming from metaphorisms
- A short cut to optimal sequences
- Iteration and coiteration schemes for higher-order and nested datatypes
- Finite quasivarieties and self-referential conditions
- An algebraic framework for minimum spanning tree problems
- Evolution of rule-based programs
- Shortcut fusion rules for the derivation of circular and higher-order programs
- Typing theorems of omega algebra
- Programming from Galois connections
- Towards a linear algebra of programming
- A calculus for generic, QoS-aware component composition
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Declarative pearl: deriving monadic quicksort
- Sufficient and necessary conditions for solution finding in valuation-based systems
- Point axioms and related conditions in Dedekind categories
- A linear algebra approach to OLAP
- Kleisli, Parikh and Peleg compositions and liftings for multirelations
- Why mathematics needs engineering
- Formal derivation of greedy algorithms from relational specifications: a tutorial
- Kernels, in a nutshell
- A perspective on service orchestration
- Normal forms for binary relations
- Components and acyclicity of graphs. An exercise in combining precision with concision
- NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS
- Incremental computing with abstract data structures
- A local graph-rewriting system for deciding equality in sum-product theories
- An exercise on transition systems
- An algebraic calculus of database preferences
- Typed linear algebra for weigthed (probabilistic) automata
- Relation Algebras, Matrices, and Multi-valued Decision Diagrams
- A relation-algebraic approach to multirelations and predicate transformers
- Sequential decision problems, dependent types and generic solutions
- ``Keep definition, change category -- a practical approach to state-based system calculi
- A single complete relational rule for coalgebraic refinement
- Type Fusion
- Algorithmic problem solving
- Relation-algebraic verification of Prim's minimum spanning tree algorithm
- The HOL-Omega Logic
- Cardinality in Allegories
- An Ordered Category of Processes
- Zippy Tabulations of Recursive Functions
- Algebra of Programming Using Dependent Types
- Libraries for generic programming in Haskell
- A coalgebraic perspective on logical interpretations
- scientific article; zbMATH DE number 3936467 (Why is no real title available?)
- scientific article; zbMATH DE number 3982493 (Why is no real title available?)
- Towards ``mouldable code via nested code graph transformation
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- Program algebras of recursive functions
- scientific article; zbMATH DE number 1059320 (Why is no real title available?)
- Contributions to a computational theory of policy advice and avoidability
- Transport of finiteness structures and applications
- scientific article; zbMATH DE number 2087339 (Why is no real title available?)
- scientific article; zbMATH DE number 2087344 (Why is no real title available?)
- scientific article; zbMATH DE number 2087346 (Why is no real title available?)
- scientific article; zbMATH DE number 910715 (Why is no real title available?)
- Process Calculi à la Bird-Meertens
- When is a function a fold or an unfold?
- Stably compact spaces and closed relations
- scientific article; zbMATH DE number 1390330 (Why is no real title available?)
- scientific article; zbMATH DE number 7379288 (Why is no real title available?)
- Extensional equality preservation and verified generic programming
- A greedy algorithm for dropping digits
- Longest segment of balanced parentheses: an exercise in program inversion in a segment problem
- Convexity via Weak Distributive Laws
- High-level signatures and initial semantics
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- An algebraic approach to multirelations and their properties
- Extended Static Checking by Calculation Using the Pointfree Transform
- Stone relation algebras
- Allegories and collagories for transformation of graph structures considered as coalgebras
- Transformation of structure-shy programs with application to XPath queries and strategic functions
- A representation theorem for second-order functionals
- Indexed containers
- Interleaving data and effects
- Calculating a linear-time solution to the densest-segment problem
- Unifying structured recursion schemes. An extended study
- Dedekind categories with cutoff operators
- Denotation by Transformation
- Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck}
- Fusion of recursive programs with computational effects
- Imperative abstractions for functional actions
- Determinisation of relational substitutions in ordered categories with domain
- Cardinality functions in allegories
- scientific article; zbMATH DE number 7779293 (Why is no real title available?)
- On difunctions
- Synthesis of implementations for divide-and-conquer specifications
- Fantastic morphisms and where to find them. A guide to recursion schemes
- Dependences between domain constructions in heterogeneous relation algebras
- Characterizing functions mappable over GADTs
- Lax Liftings and Lax Distributive Laws
- Map fusion for nested datatypes in intensional type theory
- Pointfree expression and calculation: From quantification to temporal logic
- Recursion schemes in Coq
- Determinism of multirelations
- Why adjunctions matter -- a functional programmer perspective
- Hume box calculus: Robust system development through software transformation
- Relation-algebraic verification of disjoint-set forests
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331824)
