Sciweavers

4151 search results - page 456 / 831
» Language Driven System Design
Sort
View
POPL
2004
ACM
16 years 7 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
ICFP
2003
ACM
16 years 6 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
PLPV
2009
ACM
16 years 3 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
16 years 1 months ago
Demystifying magic: high-level low-level programming
r of high-level languages lies in their abstraction over hardware and software complexity, leading to greater security, better reliability, and lower development costs. However, o...
Daniel Frampton, Stephen M. Blackburn, Perry Cheng...
EACL
1989
ACL Anthology
15 years 8 months ago
A rich environment for experimentation with unification grammars
This paper describes some of the features of a sophisticated language and environment designed for experimentation with unification-oriented linguistic descriptions. The system, w...
Rod L. Johnson, Mike Rosner