6794 search results - page 864 / 1359 » Semantics of Visual Languages |
152
click to vote
PPDP
2001
Springer
15 years 11 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
190
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
175
click to vote
UIST
1998
ACM
15 years 11 months ago
1998
ACM
Textual query languages based on Boolean logic are common amongst the search facilities of on-line information repositories. However, there is evidence to suggest that the syntact...
171
click to vote
FPCA
1989
15 years 11 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
205
click to vote
POPL
1990
ACM
15 years 11 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...