136 search results - page 7 / 28 » Typed Logical Variables in Haskell |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
IFL
1997
Springer
14 years 22 days ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
TCAD
2008
13 years 8 months ago
2008
Abstract--The fabrication of crossbar memories with sublithographic features is expected to be feasible within several emerging technologies; in all of them, the nanowire (NW) deco...