Sciweavers

41 search results - page 1 / 9
» Product Operations in Strong Monads
Sort
View
TPHOL
2009
IEEE
14 years 4 days ago
A Hoare Logic for the State Monad
Abstract. This pearl examines how to verify functional programs written using the state monad. It uses Coq’s Program framework to provide strong specifications for the standard ...
Wouter Swierstra
ENTCS
2002
114views more  ENTCS 2002»
13 years 5 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
LISP
2006
105views more  LISP 2006»
13 years 5 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
WSC
1998
13 years 6 months ago
Simulation of Large Precast Operations
This paper presents the analysis of the optimization for the production of precast pieces in a workshop with the help of simulation to obtain several working alternatives. The mai...
Edmundo Balbontín-Bravo