Results 1  10
of
1,294,586
The HigherOrder Recursive Path Ordering
 FOURTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
, 1999
"... This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by adapting the recursive path ordering definition to terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. The obtained ordering is wellfoun ..."
Abstract

Cited by 58 (12 self)
 Add to MetaCart
This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by adapting the recursive path ordering definition to terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. The obtained ordering is well
HigherOrder Abstract Syntax
"... We describe motivation, design, use, and implementation of higherorder abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding informat ..."
Abstract

Cited by 358 (18 self)
 Add to MetaCart
We describe motivation, design, use, and implementation of higherorder abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 362 (10 self)
 Add to MetaCart
, higherorder languages like Scheme, ML, and Common Lisp should run as fast as their FORTRAN and C counterparts. They should, but they don’t. A major reason is the level of optimisation applied to these two classes of languages. Many FORTRAN and C compilers employ an arsenal of sophisticated global
Lambdafree logical frameworks
 Ann. Pure Appl. Logic
"... We present the definition of the logical framework TF, the Type Framework. TF is a lambdafree logical framework; that is, it does not include lambdaabstraction or product kinds. We give formal proofs of several results in the metatheory of TF, and show how it can be conservatively embedded in the ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present the definition of the logical framework TF, the Type Framework. TF is a lambdafree logical framework; that is, it does not include lambdaabstraction or product kinds. We give formal proofs of several results in the metatheory of TF, and show how it can be conservatively embedded
LambdaFree Logical Frameworks ✩
, 804
"... We present the definition of the logical framework TF, the Type Framework. TF is a lambdafree logical framework; it does not include lambdaabstraction or product kinds. We give formal proofs of several results in the metatheory of TF, and show how it can be conservatively embedded in the logical f ..."
Abstract
 Add to MetaCart
We present the definition of the logical framework TF, the Type Framework. TF is a lambdafree logical framework; it does not include lambdaabstraction or product kinds. We give formal proofs of several results in the metatheory of TF, and show how it can be conservatively embedded in the logical
Polymorphic higherorder recursive path orderings
 Journal of the ACM
, 2005
"... This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by defining a family of recursive path orderings for terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. These relations can be generated fro ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by defining a family of recursive path orderings for terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. These relations can be generated
Higherorder logic programming
 HANDBOOK OF LOGIC IN AI AND LOGIC PROGRAMMING, VOLUME 5: LOGIC PROGRAMMING. OXFORD (1998
"... ..."
Certified higherorder recursive path ordering
 In RTA, LNCS
, 2006
"... Abstract. Recursive path ordering (RPO) is a wellknown reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higherorder case thus creating the higherorder recursive path order ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. Recursive path ordering (RPO) is a wellknown reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higherorder case thus creating the higherorder recursive path
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 507 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
Results 1  10
of
1,294,586