291 search results - page 51 / 59 » A Logic for Parametric Polymorphism |
105
click to vote
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
LISP
2008
14 years 9 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
The GENIE project has built a Grid enabled framework that facilitates the integration, execution and management of component models for the study of the Earth system over millennia...
66
Voted
DFT
2006
IEEE
15 years 1 months ago
2006
IEEE
With the recent development of nanoscale materials and assembly techniques, it is envisioned to build high-density reconfigurable systems which have never been achieved by the pho...
67
Voted
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...