Results 1  10
of
1,191
LambdaCalculus Schemata
, 1993
"... A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its constan ..."
Abstract

Cited by 107 (1 self)
 Add to MetaCart
A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its
c ○ 1993 Kluwer Academic Publishers – Manufactured in The Netherlands LambdaCalculus Schemata ∗
"... Abstract. A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for i ..."
Abstract
 Add to MetaCart
Abstract. A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation
On Constructor Rewrite Systems and the LambdaCalculus
, 2009
"... We prove that orthogonal constructor term rewrite systems and lambdacalculus with weak (i.e., no reduction is allowed under the scope of a lambdaabstraction) callbyvalue reduction can simulate each other with a linear overhead. In particular, weak callbyvalue betareduction can be simulated by ..."
Abstract
 Add to MetaCart
We prove that orthogonal constructor term rewrite systems and lambdacalculus with weak (i.e., no reduction is allowed under the scope of a lambdaabstraction) callbyvalue reduction can simulate each other with a linear overhead. In particular, weak callbyvalue betareduction can be simulated
Developing (Meta)Theory of lambdacalculus in the Theory of Contexts
 Proc. MERLIN’01, TR 2001/26, Dept. of Math. and Comp. Sci., Univ. of Leicester
, 2001
"... . We present a case study on the formal development of a non trivial (meta)theory in the Theory of Contexts using the Coq proof assistant. The methodology underlying the Theory of Contexts for reasoning on systems presented in HOAS is based on an axiomatic syntactic standpoint. We feel that one ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
of the main advantages of this approach, is that it requires a very low logical overhead. The object logic we focus on is the lazy, callbyname #calculus (#cbn ), both untyped and simply typed. We will see that the formal, fully detailed development of the theory of #cbn in the Theory of Contexts
A translation approach to portable ontology specifications
 KNOWLEDGE ACQUISITION
, 1993
"... To support the sharing and reuse of formally represented knowledge among AI systems, it is useful to define the common vocabulary in which shared knowledge is represented. A specification of a representational vocabulary for a shared domain of discourse — definitions of classes, relations, functions ..."
Abstract

Cited by 3282 (9 self)
 Add to MetaCart
, functions, and other objects — is called an ontology. This paper describes a mechanism for defining ontologies that are portable over representation systems. Definitions written in a standard format for predicate calculus are translated by a system called Ontolingua into specialized representations
Ontologies: Principles, methods and applications
 KNOWLEDGE ENGINEERING REVIEW
, 1996
"... This paper is intended to serve as a comprehensive introduction to the emerging field concerned with the design and use of ontologies. We observe that disparate backgrounds, languages, tools, and techniques are a major barrier to effective communication among people, organisations, and/or software s ..."
Abstract

Cited by 570 (3 self)
 Add to MetaCart
This paper is intended to serve as a comprehensive introduction to the emerging field concerned with the design and use of ontologies. We observe that disparate backgrounds, languages, tools, and techniques are a major barrier to effective communication among people, organisations, and/or software systems. We show how the development and implementation of an explicit account of a shared understanding (i.e. an `ontology') in a given subject area, can improve such communication, which in turn, can give rise to greater reuse and sharing, interoperability, and more reliable software. After motivating their need, we clarify just what ontologies are and what purposes they serve. We outline a methodology for developing and evaluating ontologies, first discussing informal techniques, concerning such issues as scoping, handling ambiguity, reaching agreement and producing de nitions. We then consider the bene ts of and describe, a more formal approach. We revisit the scoping phase, and discuss the role of formal languages and techniques in the specification, implementation and evaluation of ontologies. Finally, we review the state of the art and practice in this emerging field,
Dependent Types in Practical Programming
 In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages
, 1998
"... Programming is a notoriously errorprone process, and a great deal of evidence in practice has demonstrated that the use of a type system in a programming language can effectively detect program errors at compiletime. Moreover, some recent studies have indicated that the use of types can lead to si ..."
Abstract

Cited by 341 (38 self)
 Add to MetaCart
Programming is a notoriously errorprone process, and a great deal of evidence in practice has demonstrated that the use of a type system in a programming language can effectively detect program errors at compiletime. Moreover, some recent studies have indicated that the use of types can lead to significant enhancement of program performance at runtime. For the sake of practicality of typechecking, most type systems developed for general purpose programming languages tend to be simple and coarse, and this leaves ample room for improvement. As an advocate of types, this thesis addresses the issue of designing a type system for practical programming in which a notion of dependent types is available, leading to more accurate capture of program invariants with types. In contrast to developing a type theory with dependent types and then designing upon it a functional programming language, we study practical methods for extending the type systems of existing programming languages with dep...
On Applying ...Style of Unification for SimplyTyped Higher Order Unification in the Pure lambdaCalculus
"... . A precooking translation for applying the se style of uni cation to higher order unication (HOU) in the pure calculus is presented. The precooking jointly with a back translation complement a se  unication method recently developed by the authors. Their correctness and completeness are s ..."
Abstract
 Add to MetaCart
. A precooking translation for applying the se style of uni cation to higher order unication (HOU) in the pure calculus is presented. The precooking jointly with a back translation complement a se  unication method recently developed by the authors. Their correctness and completeness
Categorial Type Logics
 Handbook of Logic and Language
, 1997
"... Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource mana ..."
Abstract

Cited by 299 (6 self)
 Add to MetaCart
Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource
The maximality of the typed lambda calculus and of cartesian closed categories
 Publ. Inst. Math. (N.S
"... From the analogue of Böhm’s Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given here ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
From the analogue of Böhm’s Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given
Results 1  10
of
1,191