Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 21 - 30
of
5,069
What is a Universal Higher-Order Programming Language?
- In Proc. International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science
, 1993
"... . In this paper, we develop a theory of higher-order computability suitable for comparing the expressiveness of sequential, deterministic programming languages. The theory is based on the construction of a new universal domain T and corresponding universal language KL. The domain T is universal for ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
. In this paper, we develop a theory of higher-order computability suitable for comparing the expressiveness of sequential, deterministic programming languages. The theory is based on the construction of a new universal domain T and corresponding universal language KL. The domain T is universal
The Semantics and Implementation of Bindings in Higher-Order Programming Languages
, 1995
"... A fundamental activity in programming language design is the association of a name to a syntactic phrase. This is called a definition binding, since the name defines the syntactic phrase. Bindings can also arise as a consequence of parameter transmission, via the association of a formal parameter n ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
of programming language design, by developing a categorical model for a higher-order, modular language. The model provides a uniform semantics of definition and parameter bindings. If the language satisfies the correspondence principle, the categorical model is a weakly symmetric, monoidal-closed category
Modular heap analysis for higher-order programs
- In Proc. SAS
, 2012
"... Abstract. We consider the problem of computing summaries for procedures that soundly capture the effect of calling a procedure on program state that includes a mutable heap. Such summaries are the basis for a compositional program analysis and key to scalability. Higher order procedures contain cal ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract. We consider the problem of computing summaries for procedures that soundly capture the effect of calling a procedure on program state that includes a mutable heap. Such summaries are the basis for a compositional program analysis and key to scalability. Higher order procedures contain
Reasoning about Imperative and Higher-Order Programs
"... Contextual equivalence, namely the property that two expressions are indistinguishable inside any program context, is a fundamental property of program expressions. Discovering methods that enable formal reasoning about contextual equivalence is hard and highly dependent on the features of the progr ..."
Abstract
- Add to MetaCart
are that they successfully deal with imperative as well as higher-order features. We demonstrate our technique by deriving sound and complete methods for proving contextual equivalence in the call-by-value lambda calculus, a lambda calculus with higher-order store, the nu-calculus, an imperative object calculus
Principal Siignatures for Higher-order Program. Modules
"... Under the Damas-Milner type discipline for functional languages, every expression has a principal type, if it elaborates at all. In the type .discipline for ML Modules, a signature expression has a principal signature, if it elaborates at all. However, while functions can be higher-order in ML, para ..."
Abstract
- Add to MetaCart
Under the Damas-Milner type discipline for functional languages, every expression has a principal type, if it elaborates at all. In the type .discipline for ML Modules, a signature expression has a principal signature, if it elaborates at all. However, while functions can be higher-order in ML
Types for Deadlock-Free Higher-Order Programs
"... Abstract. Type systems for communicating processes are typically studied using abstract models – e.g., process algebras – that distill the communication behavior of programs but overlook their structure in terms of functions, methods, objects, modules. It is not always obvious how to apply these typ ..."
Abstract
- Add to MetaCart
these type systems to structured programming languages. In this work we port a recently developed type system that ensures deadlock freedom in the pi-calculus to a higher-order language. 1
Higher-Order Programming in an OR-intensive Style
"... Because implementations tend to favour a recursive deterministic ANDintensive programming style, it seems counter intuitive that a backtracking findall-based paradigm can be more efficient. This is explained by a source level technique which is called goal precomputation, by a heapbased copy-once f ..."
Abstract
- Add to MetaCart
will try to find out how to improve the traditional AND-intensive implementation of higher-order primitives and study the impact of meta-programming constructs like call/N. We introduce a new `universal' higher-order predicate implemented also with goal precomputation which combines on the fly
Hash-Flow Taint Analysis of Higher-Order Programs
"... As web applications have grown in popularity, so have attacks on such applications. Cross-site scripting and injection attacks have become particularly problematic. Both vulnerabilities stem, at their core, from improper sanitization of user input. We propose static taint analysis, which can verify ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
the absence of unsanitized input errors at compile-time. Unfortunately, precise static analysis of modern scripting languages like Python is challenging: higher-orderness and complex control-flow collide with opaque, dynamic data structures like hash maps and objects. The interdependence of data
Higher-Order Programming for Modeling Music Theories
"... Modeling music theories with computer programs has attracted composers and scholars for a long time. On the one hand, the resulting programs can serve as algorithmic composition tools. On the other hand, such an approach leads to a better understanding of existing as well as newly developed theories ..."
Abstract
- Add to MetaCart
Modeling music theories with computer programs has attracted composers and scholars for a long time. On the one hand, the resulting programs can serve as algorithmic composition tools. On the other hand, such an approach leads to a better understanding of existing as well as newly developed
Results 21 - 30
of
5,069
