29 search results - page 5 / 6 » A Calculus of Untyped Aspect-Oriented Programs |
FPCA
1989
13 years 9 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
SCP
2011
13 years 22 days ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
PPDP
2010
Springer
13 years 4 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
ICFP
2002
ACM
14 years 5 months ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
CSL
2007
Springer
13 years 12 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...