69 search results - page 7 / 14 » Explaining Algebraic Theory with Functional Programs |
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
CADE
1990
Springer
13 years 11 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
TACS
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
LFP
1990
13 years 8 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...