1687 search results - page 136 / 338 » Light Functional Interpretation |
175
click to vote
ICTCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
155
click to vote
ACRI
2004
Springer
15 years 11 months ago
2004
Springer
An experimental analysis of the asynchronous version of the “Game of Life” is performed to estimate how topology perturbations modify its evolution. We focus on the study of a ...
174
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
This chapter investigates subgroup discovery as a task of constraint-based mining of local patterns, aimed at describing groups of individuals with unusual distributional character...
147
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
161
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...