منابع مشابه
Lambda Calculus with Explicit Recursion
This paper is concerned with the study of-calculus with explicit recursion, namely of cyclic-graphs. The starting point is to treat a-graph as a system of recursion equations involving-terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible for rst-order term rewriting. Surprisingly, now the connuence property breaks down in an essential way....
متن کاملEvent Calculus with Explicit Quantifiers
Kowalski and Sergot’s Event Calculus (EC ) is a simAppeared in the Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning — TIME’98 (R. Morris, L. Khatib editors), pp. 81–88, IEEE Computer Society Press, Sanibel Island, FL, 16–17 May 1998. ple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which pro...
متن کاملExplicit substitutions for the - calculus ?
The-calculus is a-calculus with a control-like operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce exp, an explicit substitution calculus for , and study its properties. In particular, we show that exp preserves strong normalisation, which provides us with the rst example {moreover a very natural one indeed{ of explicit substitution ca...
متن کاملA Calculus of Constructions with Explicit Subtyping
The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. We avoid problems related to coercions and dependent types by using the Tarski style of universes and by adding equations to reflect ...
متن کاملStrong Bisimulation for the Explicit Fusion Calculus
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulation. In the synchronous pi calculus, it is well-known that the various natural definitions of (strong) bisimulation yield different relations. In contrast, for the asynchronous pi calculus, they collapse to a single re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1973
ISSN: 0024-3795
DOI: 10.1016/0024-3795(73)90019-0