Sciweavers

973 search results - page 71 / 195
» Construction of a Semantic Model for a Typed Assembly Langua...
Sort
View
POPL
2005
ACM
14 years 8 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
ERLANG
2008
ACM
13 years 9 months ago
Testing Erlang data types with quviq quickcheck
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...
Thomas Arts, Laura M. Castro, John Hughes
BIRTHDAY
2003
Springer
14 years 28 days ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg
POPL
2007
ACM
14 years 8 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
HT
1998
ACM
13 years 12 months ago
Enforcing Strong Object Typing in Flexible Hypermedia
The presentation layer of hypermedia systems could benefit from standard object querying functionality and this is most effective if strong typing is enforced. By strong typing we...
Pedro Furtado, Henrique Madeira