Sciweavers

1264 search results - page 77 / 253
» Abstract machines for programming language implementation
Sort
View
SIGADA
2004
Springer
14 years 2 months ago
GNAT: on the road to Ada 2005
The GNAT Development Team is directly involved with the Ada 2005 effort, both participating in the Ada Rapporteur Group (ARG), and implementing and testing the new features propo...
Javier Miranda, Edmond Schonberg
ML
2006
ACM
113views Machine Learning» more  ML 2006»
14 years 3 months ago
A separate compilation extension to standard ML
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
David Swasey, Tom Murphy VII, Karl Crary, Robert H...
EUROCAST
2001
Springer
118views Hardware» more  EUROCAST 2001»
14 years 1 months ago
A Language Prototyping Tool Based on Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
José Emilio Labra Gayo, Juan Manuel Cueva L...
ENTCS
2007
109views more  ENTCS 2007»
13 years 9 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
JAR
2010
108views more  JAR 2010»
13 years 7 months ago
Procedural Representation of CIC Proof Terms
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
Ferruccio Guidi