Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
While class-based object-oriented programming languages provide a flexible mechanism for re-using and managing related pieces of code, they typically lack linguistic facilities fo...
Matthew Flatt, Shriram Krishnamurthi, Matthias Fel...
The significance of functional programming is revealed as that the feasible approach to language extensibility which it enables is further applicable to programming in general and...
Paul A. Bailes, Colin J. M. Kemp, Ian Peake, Sean ...
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...