Sciweavers

20 search results - page 3 / 4
» Syntax for Free: Representing Syntax with Binding Using Para...
Sort
View
POPL
2007
ACM
14 years 5 months ago
Generative unbinding of names
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...
Andrew M. Pitts, Mark R. Shinwell
ICFP
2012
ACM
11 years 7 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
SE
2010
13 years 6 months ago
Projectional Language Workbenches as a Foundation for Product Line Engineering
: In this paper I explain the benefits of projectional language workbenches for product line engineering. The ability to extend programming languages with domain specific concepts,...
Markus Voelter
PPDP
2009
Springer
13 years 11 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
JODS
2006
131views Data Mining» more  JODS 2006»
13 years 4 months ago
Inheritance in Rule-Based Frame Systems: Semantics and Inference
Knowledge representation languages that combine rules with object-oriented features akin to frame systems have recently attracted a lot of research interest, and F-logic is widely ...
Guizhen Yang, Michael Kifer