89 search results - page 2 / 18 » Canonical Abstract Syntax Trees |
SFP
2001
14 years 6 days ago
2001
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
CADE
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
MFCS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
TPHOL
2005
IEEE
14 years 4 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract-- In a first paper we studied system theoretic properties of patterned systems and solved classical control synthesis problems with the added requirement to preserve the s...