292 search results - page 6 / 59 » A linearization of the Lambda-calculus and consequences |
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
In efforts to overcome the complexity of the syntax and the lack of formal semantics of conventional hardware description languages, a number of functional hardware description la...
107
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
100
click to vote
TACS
1994
Springer
15 years 3 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
109
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
65
Voted
LOGCOM
2000
14 years 11 months ago
2000
