Results 1 - 10
of
4,979
A Framework for Defining Logics
- JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lof's system of ariti ..."
Abstract
-
Cited by 795 (42 self)
- Add to MetaCart
of arities. The treatment of rules and proofs focuses on his notion of a judgement. Logics are represented in LF via a new principle, the judgements as types principle, whereby each judgement is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurrence
Parametric Higher-Order Abstract Syntax for Mechanized Semantics
, 2008
"... We present parametric higher-order abstract syntax (PHOAS), a new approach to formalizing the syntax of programming languages in computer proof assistants based on type theory. Like higherorder abstract syntax (HOAS), PHOAS uses the meta language’s binding constructs to represent the object language ..."
Abstract
-
Cited by 42 (2 self)
- Add to MetaCart
, and translation from a language with ML-style pattern matching to a simpler language with no variable-arity binding constructs. By avoiding the syntactic hassle associated with first-order representation techniques, we achieve a very high degree of proof automation.
The English Noun Phrase in its Sentential Aspect
- PH.D. DISSERTATION MIT
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by a functional element (i.e., "non-lexical" category) D, identified with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by Infl(ection), under ass ..."
Abstract
-
Cited by 532 (4 self)
- Add to MetaCart
assumptions now standard within the Government-Binding (GB) framework. The central empirical problem addressed is the question of the proper analysis of the so-called "Poss-ing" gerund in English. This construction possesses simultaneously many properties of sentences, and many properties of noun
A really temporal logic
- J. ACM
, 1994
"... We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable f ..."
Abstract
-
Cited by 303 (28 self)
- Add to MetaCart
We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable
A Fast Flexible Docking Method using an Incremental Construction Algorithm
- J. Mol. Biol
, 1996
"... We present an automatic method for docking organic ligands into protein Center for Information binding sites. The method can be used in the design process of specific Technology (GMD), Institute protein ligands. It combines an appropriate model of the physico-chemical for Algorithms and Scientific p ..."
Abstract
-
Cited by 227 (5 self)
- Add to MetaCart
We present an automatic method for docking organic ligands into protein Center for Information binding sites. The method can be used in the design process of specific Technology (GMD), Institute protein ligands. It combines an appropriate model of the physico-chemical for Algorithms and Scientific
Object-Oriented Type Inference
- OOPSLA'91
, 1991
"... We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, annotates the program with type information, allows polymorphic methods, and can be used as the basis of an op-timizing co ..."
Abstract
-
Cited by 232 (15 self)
- Add to MetaCart
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, annotates the program with type information, allows polymorphic methods, and can be used as the basis of an op
Teleo-reactive programs for agent control
- Journal of Artificial Intelligence Research
, 1994
"... A formalism is presented for computing and organizing actions for autonomous agents in dynamic environments. We introduce the notion of teleo-reactive (T-R) programs whose execution entails the construction of circuitry for the continuous computation of the parameters and conditions on which agent a ..."
Abstract
-
Cited by 226 (1 self)
- Add to MetaCart
action is based. In addition to continuous feedback, T-R programs support parameter binding and recursion. A primary di erence between T-R programs and many other circuit-based systems is that the circuitry of T-R programs is more compact; it is constructed at run time and thus does not have toanticipate
An Architecture for Next Generation Middleware
- Middleware, IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing (Middleware’98), Lake District
, 1998
"... This paper proposes an approach to the design of configurable and open middleware platforms based on the concept of reflection. More specifically, the paper introduces a language-independent reflective architecture featuring a perobject meta-space, the use of meta-models to structure meta-space, and ..."
Abstract
-
Cited by 207 (33 self)
- Add to MetaCart
-space, and a consistent use of object graphs for composite components. This is complemented by a component framework supporting the construction of meta-spaces. The paper also reports on experiences of implementing the architecture (with emphasis on experiments with open bindings). Keywords Middleware, (re
Genomic Cis-regulatory logic: experimental and computational analysis of a sea urchin gene
- Science
, 1998
"... The genomic regulatory network that controls gene expression ultimately determines form and function in each species. The operational nature of the regulatory programming specified in cis-regulatory DNA sequence was determined from a detailed functional analysis of a sea urchin control element that ..."
Abstract
-
Cited by 192 (2 self)
- Add to MetaCart
activities are integrated in the proximal element, which contains seven target sites for DNA binding proteins. A quantitative computational model of this regulatory element was constructed that explicitly reveals the logical interrelations hard-wired into the DNA. The genomic organization of cis
The cognitive neurosciences of constructive memory.
- Annu. Rev. Psychol.
, 1998
"... ABSTRACT Numerous empirical and theoretical observations point to the constructive nature of human memory. This paper reviews contemporary research pertaining to two major types of memory distortions that illustrate such constructive processes: (a) false recognition and (b) intrusions and confabula ..."
Abstract
-
Cited by 94 (13 self)
- Add to MetaCart
ABSTRACT Numerous empirical and theoretical observations point to the constructive nature of human memory. This paper reviews contemporary research pertaining to two major types of memory distortions that illustrate such constructive processes: (a) false recognition and (b) intrusions
Results 1 - 10
of
4,979