1368 search results - page 173 / 274 » Recursive modules for programming |
ACL2
2006
ACM
14 years 3 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
MPC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
FASE
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...