198 search results - page 3 / 40 » A New Approach to Abstract Syntax Involving Binders |
ICFP
2012
ACM
11 years 8 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
ASPDAC
2006
ACM
13 years 12 months ago
2006
ACM
Abstract— An efficient algorithm for three-dimensional (3D) capacitance extraction on multi-layered and lossy substrate is presented. The new algorithm represents a major improv...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
PPDP
2004
Springer
13 years 11 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
INLG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...