Titlebook: Algebraic Methodology and Software Technology (AMAST’93); Proceedings of the T Maurice Nivat,Charles Rattray,Giuseppe Scollo Conference pro

社團(tuán)

GIBE

larder

Full Abstraction in Structural Operational Semantics (extended abstract)rmats of transition system specifications using Plotkin’s structural approach. For several equivalences in the linear time — branching time spectrum a format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several for

Ceremony

Camouflage

一加就噴出

Dimension-Complemented Lambda Abstraction Algebrasthe first-order predicate logic. Like combinatory algebras they can be denned by true identities and thus form a variety in the sense of universal algebra, but they differ from combinatory algebras in several important respects. The most natural LAA’s are obtained by coordinatizing environment model

細(xì)頸瓶

phase-2-enzyme

Increasing the Level of Abstraction in Traditional Functional Languages by Using Compile-time Refleces, yet cannot express certain new kinds of abstraction recently identified. In this paper we report on a simple technique we call . and show how this technique can be added to traditional functional languages by the addition of an explicit user programmable phase distinction in their compilation. T

deviate

A Coherent Type System for a Concurrent, Functional and Imperative Programming Languageesign of this specification language follows the same approach as the one used in the design of Extended ML [14]. The starting point is the design of an implicitly typed, polymorphic, concurrent and functional programming language. Axioms are then added in the signatures and structures as in Extende

深淵