229 search results - page 3 / 46 » A General Name Binding Mechanism |
ERLANG
2006
ACM
14 years 19 hour ago
2006
ACM
This article introduces Dryverl, an Erlang/C binding code r. Dryverl aims at becoming the most abstract, open and efficient tool for implementing any Erlang/C bindings, as either...
POPL
2000
ACM
13 years 9 months ago
2000
ACM
We introduce a language for creating and manipulating certificates, that is, digitally signed data based on public key cryptography, and a system for revoking certificates. Our ap...
ICFP
2005
ACM
14 years 6 months ago
2005
ACM
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
PPDP
2010
Springer
13 years 4 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
PEPM
1994
ACM
13 years 10 months ago
1994
ACM
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...