Sciweavers

89 search results - page 3 / 18
» Abstract Syntax and Variable Binding
Sort
View
ICFP
2005
ACM
14 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
ENTCS
2007
102views more  ENTCS 2007»
13 years 5 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
FMOODS
2003
13 years 6 months ago
A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts
This paper outlines a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculu...
Cees Pierik, Frank S. de Boer
LICS
2008
IEEE
13 years 11 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
ESOP
2008
Springer
13 years 7 months ago
Practical Programming with Higher-Order Encodings and Dependent Types
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
Adam Poswolsky, Carsten Schürmann