217 search results - page 2 / 44 » A New Approach to Abstract Syntax with Variable Binding |
ACTAC
2002
13 years 5 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
ICFP
2001
ACM
14 years 5 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
ICFP
2005
ACM
14 years 5 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...
FMOODS
2003
13 years 6 months ago
2003
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...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...