Sciweavers

77 search results - page 14 / 16
» Algebras for Parameterised Monads
Sort
View
ENTCS
2010
117views more  ENTCS 2010»
13 years 11 months ago
Categorifying Computations into Components via Arrows as Profunctors
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...
Kazuyuki Asada, Ichiro Hasuo
TPHOL
2007
IEEE
14 years 5 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
GI
1997
Springer
14 years 3 months ago
Functional Object-Oriented Programming with Object-Gofer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
Wolfram Schulte, Klaus Achatz
VMCAI
2010
Springer
14 years 8 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
CSL
2010
Springer
13 years 12 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter