this paper provides two results concerning Order-Sorted logic with Term Declarations. First, we show that linear term declarations can be transformed conservatively into function declarations, thus yielding elementary...
详细信息
the inheritance anomaly [23] refers to the serious difficulty in combining inheritance and concurrency in a simple and satisfactory way within a concurrent object-oriented language. the problem is closely connected wi...
详细信息
We have formally specified a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automatedreasoning system Nqthm, i.e., the Boyer-Moore theorem Prov...
详细信息
the proceedings contain 26 papers. the special focus in this conference is on Mathematical Foundations of programming Semantics. the topics include: Types, abstraction, and parametric polymorphism, part 2;call-by-valu...
ISBN:
(纸本)9783540555117
the proceedings contain 26 papers. the special focus in this conference is on Mathematical Foundations of programming Semantics. the topics include: Types, abstraction, and parametric polymorphism, part 2;call-by-value combinatory logic and the lambda-value calculus;from operational to denotational semantics;a simple language supporting angelic nondeterminism and parallel composition;the equivalence of two semantic definitions for inheritance in object-oriented languages;primitive recursive functional with dependent types;typed homomorphic relations extended with subtypes;information links in domain theory;nonwellfounded sets and programming language semantics;simultaneous substitution in the typed lambda calculus;HSP type theorems in the category of posets;decomposition of domains;cartesian closed categories of domains and the space proj(D);an upper power domain construction in terms of strongly compact sets;correctness of procedure representations in higher-order assembly language;an algorithm for analyzing communicating processes;continuous functions and parallel algorithms on concrete data structures;pomsets and mazurkiewicz traces;on relating concurrency and nondeterminism;on continuous time agents;a monoidal closed category of event structures;an exper model for quest;equations for if-then-else;program correctness and matricial iteration theories;liminf progress measures;and connections.
Since it is unsound to reason about call-by-value languages using call-by name equational theories, we present two by-value combinatory logics and translations from the λ-value (λv) calculus to the logics. the first...
详细信息
Various forms of typed λ-calculi have been proposed as specification languages for representing wide varieties of object logics. the logical framework, LF, is an example of such a dependent-type λ-calculus. A small ...
详细信息
In this paper we present a parallel algorithm for computing the closure of a set under an operation. this particular type of computation appears in a variety of disguises, and has been used in automatedtheorem provin...
详细信息
When hyperresolution used with equality axioms, the function substitution axioms tend to produce myriads of new clauses whenever a positive equality literal is present. the analogue for paramodulation is the large num...
详细信息
暂无评论