Results 1  10
of
70,128
CurryHoward terms for Linear Logic
 In Logic Colloquium
, 1994
"... In this paper we 1. provide a natural deduction system for full firstorder linear logic, 2. introduce CurryHowardstyle terms for this version of linear logic, 3. extend the notion of substitution of CurryHoward terms for term variables, 4. define the reduction rules for the CurryHoward terms ..."
Abstract
 Add to MetaCart
In this paper we 1. provide a natural deduction system for full firstorder linear logic, 2. introduce CurryHowardstyle terms for this version of linear logic, 3. extend the notion of substitution of CurryHoward terms for term variables, 4. define the reduction rules for the CurryHoward
CurryHoward terms for Linear Logic
 IN LOGIC COLLOQUIUM
, 1994
"... In this paper we 1. provide a natural deduction system for full firstorder linear logic, 2. prove its equivalence to Girard's original system, 3. introduce CurryHowardstyle terms for this version of linear logic, 4. extend the notion of substitution of CurryHoward terms for term variables a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we 1. provide a natural deduction system for full firstorder linear logic, 2. prove its equivalence to Girard's original system, 3. introduce CurryHowardstyle terms for this version of linear logic, 4. extend the notion of substitution of CurryHoward terms for term variables
Program Extraction for Full Linear Logic
, 1995
"... In this paper we 1. provide a natural deduction system for full firstorder linear logic, 2. introduce CurryHowardstyle terms for this version of linear logic, 3. prove strong normalization for the system, and 4. prove that given a proof of 8x9y ff(x; y) and any individual term t we can compute ..."
Abstract
 Add to MetaCart
In this paper we 1. provide a natural deduction system for full firstorder linear logic, 2. introduce CurryHowardstyle terms for this version of linear logic, 3. prove strong normalization for the system, and 4. prove that given a proof of 8x9y ff(x; y) and any individual term t we can compute
Defining Virtual Reality: Dimensions Determining Telepresence
 JOURNAL OF COMMUNICATION
, 1992
"... Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variablebased definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "presen ..."
Abstract

Cited by 534 (0 self)
 Add to MetaCart
Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variablebased definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
. These techniques are presented in terms of notions of equivalence between modelling entities. A framewo...
Parallel Networks that Learn to Pronounce English Text
 COMPLEX SYSTEMS
, 1987
"... This paper describes NETtalk, a class of massivelyparallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed h ..."
Abstract

Cited by 548 (5 self)
 Add to MetaCart
is essential. (iv) Relearning after damage is much faster than learning during the original training. (v) Distributed or spaced practice is more effective for longterm retention than massed practice. Network models can be constructed that have the same performance and learning characteristics on a particular
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 728 (81 self)
 Add to MetaCart
A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes
A Theory of Objects
, 1996
"... Objectoriented languages were invented to provide an intuitive view of data and computation, by drawing an analogy between software and the physical world of objects. The detailed explanation of this intuition, however, turned out to be quite complex; there are still no standard definitions of such ..."
Abstract

Cited by 1002 (13 self)
 Add to MetaCart
Objectoriented languages were invented to provide an intuitive view of data and computation, by drawing an analogy between software and the physical world of objects. The detailed explanation of this intuition, however, turned out to be quite complex; there are still no standard definitions of such fundamental notions as objects, classes, and inheritance. Much progress was made by investigating the notion of subtyping within procedural languages and their theoretical models (lambda calculi). These studies clarified the role of subtyping in objectoriented languages, but still relied on complex encodings to model objectoriented features. Recently, in joint work with Martin Abadi, I have studied more direct models of objectoriented features: object calculi. Object calculi embody, in a minimal setting, the objectoriented model of computation, as opposed to the imperative, functional, and process models. Object calculi are based exclusively on objects and methods, not on functions or data structures. They help in classifying and explaining the features of objectoriented languages, and in designing new, more regular languages. They directly inspired my design of Obliq, an objectoriented language for network programming.
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, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
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, MartinLof's system
Results 1  10
of
70,128