96 search results - page 7 / 20 » Analyzing recursive programs using a fixed-point calculus |
179
click to vote
FSTTCS
1999
Springer
15 years 10 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
161
click to vote
IFIP
2004
Springer
15 years 11 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...
183
click to vote
CALCO
2005
Springer
15 years 12 months ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
164
click to vote
TACS
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
142
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...