Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,069
Higher-Order Program Generation
, 2001
"... This dissertation addresses the challenges of embedding programming languages, specializing generic programs to specific parameters, and generating specialized instances of programs directly as executable code. Our main tools are higher-order programming techniques and automatic program generation. ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
This dissertation addresses the challenges of embedding programming languages, specializing generic programs to specific parameters, and generating specialized instances of programs directly as executable code. Our main tools are higher-order programming techniques and automatic program generation
Polymorphic Higher-Order Programming in Prolog
"... Abstract Pure logic programming lacks some features known from other modern programming languages, e.g., type systems for detection of particular programming errors at compile time and higher-order facilities for treating programs as data objects and writing more compact programs. On the one hand th ..."
Abstract
- Add to MetaCart
Abstract Pure logic programming lacks some features known from other modern programming languages, e.g., type systems for detection of particular programming errors at compile time and higher-order facilities for treating programs as data objects and writing more compact programs. On the one hand
Definitional interpreters for higher-order programming languages
- Reprinted from the proceedings of the 25th ACM National Conference
, 1972
"... Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include ..."
Abstract
-
Cited by 338 (2 self)
- Add to MetaCart
Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include
Relational semantics for higher-order programs
- Proc. 8th Int. Conf. Mathematics of Program Construction (MPC’06
, 2006
"... Abstract. Most previous work on the semantics of higher-order programs with local state involves complex storage modeling with pointers and memory cells, complicated categorical constructions, or reasoning in the presence of context. In this paper we show how a relatively simple relational semantics ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract. Most previous work on the semantics of higher-order programs with local state involves complex storage modeling with pointers and memory cells, complicated categorical constructions, or reasoning in the presence of context. In this paper we show how a relatively simple relational
Visualizing the Performance of Higher-Order Programs
, 1998
"... Profiling can provide the information needed to identify performance bottlenecks in a program, but the programmer must understand its relation to the program source in order to use this information. This is di#cult due to the tremendous volume of data collected. Moreover, program transformations suc ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
such as macro expansion and procedure inlining can obscure the relationship between the source and object code. Higher-order programs present additional challenges due to complex control flow and because they often consist of many small, often anonymous, procedures whose individual performance properties may
Correct Higher-Order Program Transformations
- Ph.D. thesis, Northeastern Univ
, 1994
"... We present a method for proving the correctness of compiler optimizations for higher-order programming languages. Programs are annotated with propositions derived as the solutions to dataflow constraints formulated as local consistency conditions for each parse tree node. We can prove that any such ..."
Abstract
- Add to MetaCart
We present a method for proving the correctness of compiler optimizations for higher-order programming languages. Programs are annotated with propositions derived as the solutions to dataflow constraints formulated as local consistency conditions for each parse tree node. We can prove that any
Dynamic Slicing In Higher-Order Programming Languages
, 1997
"... Dynamic slicing is a technique for isolating segments of a program that (potentially) contribute to the value computed at a point of interest. Dynamic slicing for restricted first-order imperative languages has been extensively studied in literature. In contrast, little research has been done with r ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
with regard to the slicing of higher-order programs. Most first-order imperative programming languages are statement-based while most higher-order programming languages are expression-based. Unlike first-order programs, higher-order programs have no simple concept of static control flow: control flow depends
More Higher Order Programming in OBJ
"... This paper discusses the use of OBJ3's parameterized modules for higher order programming, giving examples beyond those in [8, 3, 4] and showing some capabilities that may seem surprising. We also discuss parameterized views, which are not yet implemented, but which we hope soon will be. We ass ..."
Abstract
- Add to MetaCart
This paper discusses the use of OBJ3's parameterized modules for higher order programming, giving examples beyond those in [8, 3, 4] and showing some capabilities that may seem surprising. We also discuss parameterized views, which are not yet implemented, but which we hope soon will be. We
Specification and Proof of Higher-Order Programs
"... 1.2. Methods to Obtain more Reliable Programs................ 2 ..."
Abstract Value Range Analysis for Higher-Order Programs
"... We develop a value range analysis for higher-order programs. The analysis extracts a nugget that characterizes the value bindings resulting from program execution. This abstraction can be fed into a theorem prover to extract non-trivial inductive properties about programs, including the range of val ..."
Abstract
- Add to MetaCart
We develop a value range analysis for higher-order programs. The analysis extracts a nugget that characterizes the value bindings resulting from program execution. This abstraction can be fed into a theorem prover to extract non-trivial inductive properties about programs, including the range
Results 1 - 10
of
5,069
