632 search results - page 100 / 127 » Explicit Substitutions and Programming Languages |
JMLR
2012
11 years 10 months ago
2012
Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
PLDI
2010
ACM
14 years 19 days ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
JLP
2010
13 years 2 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...