Sciweavers

632 search results - page 72 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
DLS
2007
133views Languages» more  DLS 2007»
13 years 11 months ago
Mirages: behavioral intercession in a mirror-based architecture
Mirror-based systems are object-oriented reflective architectures built around a set of design principles that lead to reflective APIs which foster a high degree of reusability, l...
Stijn Mostinckx, Tom Van Cutsem, Stijn Timbermont,...
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
KI
2004
Springer
14 years 1 months ago
On-Line Decision-Theoretic Golog for Unpredictable Domains
Abstract. DTGolog was proposed by Boutilier et al. as an integration of decision-theoretic (DT) planning and the programming language Golog. Advantages include the ability to handl...
Alexander Ferrein, Christian Fritz, Gerhard Lakeme...
ESOP
2006
Springer
13 years 11 months ago
Inference of User-Defined Type Qualifiers and Qualifier Rules
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
Brian Chin, Shane Markstrum, Todd D. Millstein, Je...