Sciweavers

851 search results - page 97 / 171
» Associative definition of programming languages
Sort
View
POPL
2010
ACM
14 years 6 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
POPL
2010
ACM
14 years 6 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
POPL
2005
ACM
14 years 2 months ago
Specifying Kerberos 5 cross-realm authentication
Cross-realm authentication is a useful and interesting component of Kerberos aimed at enabling secure access to services astride organizational boundaries. We present a formalizat...
Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov,...
ENTCS
2002
136views more  ENTCS 2002»
13 years 8 months ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 1 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh