Program transformations expressed by algebraic type manipulations
Technique et Science Informatiques
Views: a way for pattern matching to cohabit with data abstraction
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Predicate calculus and program semantics
Predicate calculus and program semantics
Specification and transformation of programs: a formal approach to software development
Specification and transformation of programs: a formal approach to software development
Categories and computer science
Categories and computer science
Algebra of programming
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Some Techniques for Recursion Removal from Recursive Functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata, Languages, and Machines
Automata, Languages, and Machines
A Discipline of Programming
Algorithmic Language and Program Development
Algorithmic Language and Program Development
Nordic Journal of Computing
Pi-Nets: A Graphical Form of pi-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Towards a new conceptual framework for the modelling of dynamically distributed systems
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
The geometry of distributions in formal methods
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
Hi-index | 0.00 |
This paper describes work leading towards the concept of a Geometry of Formal Methods[Mac96],[HM97], which explores the relationship between various formal description techniques and aspects of modern abstract algebraic theories with a strong geometric interpretation, in particular such concepts as fibre-bundles, sheaves and related ideas in topology and category theory. Inspired by ideas and notions of seeking a geometry of computing and of formal methods, and with the category theoretic concepts of topos in mind, we explore how such a geometry might be expressed in concrete diagrams, and explore their ability to lay clear some of the concepts behind tail recursion optimisation. We also indicate how this approach can be used in an exposition of various published program transformation rules in this area. We also show the use of category theoretic notions to help explain the similarity of two apparently quite different diagrams. All of this points towards a future foundation for our geometry, both in diagrammatic and algebraic form, in the area of category theory.