3323 search results - page 99 / 665 » Computational Semantics with Functional Programming |
SFP
2001
14 years 11 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
RTAS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
We present a programming language for implementing multiagent systems consisting of a set of individual agents that interact with a computational organization specified in terms ...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. ...