Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Computational category theory
Proccedings of the 375th Anniversary of the Groningen University on Mathematics of Program Construction
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Data structures and program transformation
Science of Computer Programming
Notions of computation and monads
Information and Computation
Basic category theory for computer scientists
Basic category theory for computer scientists
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
The essence of functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Categories and computer science
Categories and computer science
Algebra of programming
Towards an applied mathematics for computer science
Current and future directions in applied mathematics
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Fold and unfold for program semantics
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Semantics of the Domain of Flow Diagrams
Journal of the ACM (JACM)
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Mathematics of Program Construction: Proceedings of the 2nd International Conference, Oxford, U. K., June-July 1992
Introduction to Functional Programming
Introduction to Functional Programming
Proceedings of the Mathematics of Program Construction
MPC '98 Proceedings of the Mathematics of Program Construction
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
A Typed Lambda Calculus with Categorical Type Constructors
Category Theory and Computer Science
Monads and Comonads in Intensional Semantics
Monads and Comonads in Intensional Semantics
A categorical programming language
A categorical programming language
Design patterns as higher-order datatype-generic programs
Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming
Point-free Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Transformation of structure-shy programs: applied to XPath queries and strategic functions
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A shortcut fusion rule for circular program calculation
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Coupled Transformation of Schemas, Documents, Queries, and Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Shortcut fusion rules for the derivation of circular and higher-order monadic programs
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Exploiting algebra/coalgebra duality for program fusion extensions
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Combining datatypes and effects
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Fission for program comprehension
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
A framework for point-free program transformation
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Shortcut fusion rules for the derivation of circular and higher-order programs
Higher-Order and Symbolic Computation
Point-free Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Hi-index | 0.00 |
Functional programs are merely equations; they may be manipulated by straightforward equational reasoning. In particular, one can use this style of reasoning to calculate programs, in the same way that one calculates numeric values in arithmetic. Many useful theorems for such reasoning derive from an algebraic view of programs, built around datatypes and their operations. Traditional algebraic methods concentrate on initial algebras, constructors, and values; dual co-algebraic methods concentrate on final co-algebras, destructors, and processes. Both methods are elegant and powerful; they deserve to be combined.