4355 search results - page 13 / 871 » From Interpretation to Compilation |
IFL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
SIGCSE
2005
ACM
14 years 1 months ago
2005
ACM
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
ADBIS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Database modeling is based on the assumption of a high regularity of its application areas, an assumption which applies to both the structure of data and the behavior of ...
LCPC
2009
Springer
14 years 7 days ago
2009
Springer
Programming heterogeneous parallel computer systems is notoriously difficult, but MIMD models have proven to be portable across multi-core processors, clusters, and massively paral...
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, cal...