3713 search results - page 23 / 743 » Constructing a Calculus of Programs |
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constru...
TAPSOFT
1987
Springer
13 years 11 months ago
1987
Springer
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
ENTCS
2002
13 years 7 months ago
2002
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They have their theoretical foundation in J...
HASKELL
2009
ACM
14 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...