Algebraic definition of a functional programming language and its semantic models

Broy, Manfred; Wirsing, Martin

doi:10.1051/ita/1983170201371

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Env = Map(vidloc)[env/map(vidloc)]1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1985

1989

Publication Types

Select...

Book6

Article1

Relationship

Self Cite1

Independent6

Authors

Journals

Cited by 10 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MAP is the parametric algebraic specification of finite maps (for a complete definition, see, e.g., [14]). Given two algebraic specifications A and B with main sorts a and b, respectively, ¥\JNC1{A,B) indicates the specification, with sort funct{fl,d), of the functions from elements of sort a into elements of sort h; FUNCT{^,B) has the operators Fl, F2, F3 introduced in the previous section (see [8,21]). …”

Section: Env = Map(vidloc)[env/map(vidloc)]mentioning

confidence: 99%

Direct semantics of concurrent languages in the SMoLCS approach

Astesiano

Reggio

1987

IBM J. Res. & Dev.

View full text Add to dashboard Cite

Section: Env = Map(vidloc)[env/map(vidloc)]mentioning

confidence: 99%

Direct semantics of concurrent languages in the SMoLCS approach

Astesiano

Reggio

1987

IBM J. Res. & Dev.

View full text Add to dashboard Cite

“…In this framework deterministic and non-deterministic as well as applicative and procedural programming language constructs have been formal ized (cf. Broy (1980), Broy (1983)). …”

Section: Introductionmentioning

confidence: 99%

“…As a consequence, the algebraic semantics yields for deter ministic languages a class of least fixpoint models where some of them describe the operational behaviour of programs where as others describe the functional behaviour. In particular, the weakly terminal models are fully abstract models for the functional behaviours (Broy, 1983).…”

Section: Introductionmentioning

confidence: 99%

Bisimulation in Algebraic Specifications11Work partially supported by the ESPRIT-project METEOR and by CNR (Italy).

Astesiano

Wirsing

1989

Algebraic Techniques

Self Cite

View full text Add to dashboard Cite

SMoLCS-driven concurrent calculi

Astesiano

Reggio

1987

Tapsoft '87

View full text Add to dashboard Cite

It is shown how to derive, following the principles of the SMoLCS methodology, a family of calculi, suitable for the specification of concurrent systems and languages. A calculus consists basically of a language for expressing behaviours and their parallel composition together with the rewriting rules defining their semantics; formally it is a calculus associated to an algebraic parameterized specification: for every choice of the parameters we fix one calculus in the family. The distinguishing feature of our calculi is that the combinators for behaviours include functional abstraction and application, so that behaviours can be passed as arguments and obtained as results of functions; in general behaviours can be seen just as a data type and in this sense our calculi can be higher order calculi with behaviours as fast class objects.

show abstract

Algebraic definition of a functional programming language and its semantic models

Cited by 10 publications

References 22 publications

Direct semantics of concurrent languages in the SMoLCS approach

Direct semantics of concurrent languages in the SMoLCS approach

Bisimulation in Algebraic Specifications11Work partially supported by the ESPRIT-project METEOR and by CNR (Italy).

SMoLCS-driven concurrent calculi

Contact Info

Product

Resources

About