365 search results - page 38 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
PEPM
2011
ACM
12 years 10 months ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
LMCS
2007
13 years 7 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
USENIX
1994
13 years 9 months ago
1994
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
ML
2006
ACM
14 years 1 months ago
2006
ACM
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
ICVS
2003
Springer
14 years 26 days ago
2003
Springer
We propose a method to construct computer vision systems using a workbench composed of a multi-faceted toolbox and a general purpose kernel. The toolbox is composed of an open set ...