Results 1 
6 of
6
The Oz Programming Model
 COMPUTER SCIENCE TODAY, LECTURE NOTES IN COMPUTER SCIENCE
, 1995
"... The Oz Programming Model (OPM) is a concurrent programming model subsuming higherorder functional and objectoriented programming as facets of a general model. This is particularly interesting for concurrent objectoriented programming, for which no comprehensive formal model existed until now. ..."
Abstract

Cited by 293 (10 self)
 Add to MetaCart
The Oz Programming Model (OPM) is a concurrent programming model subsuming higherorder functional and objectoriented programming as facets of a general model. This is particularly interesting for concurrent objectoriented programming, for which no comprehensive formal model existed until now. The model
Polymorphic Type Inference and Assignment
, 1991
"... We present a new approach to the polymorphic typing of data accepting inplace modi cation in MLlike languages. This approach is based on restrictions over type generalization, and a re ned typing of functions. The type system given here leads to a better integration of imperative programming sty ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
We present a new approach to the polymorphic typing of data accepting inplace modi cation in MLlike languages. This approach is based on restrictions over type generalization, and a re ned typing of functions. The type system given here leads to a better integration of imperative programming style with the purely applicative kernel of ML. In particular, generic functions that allocate mutable data can safely be given fully polymorphic types. We show the soundness of this type system, and give a type reconstruction algorithm.
An Oz Primer
 IN DFKI OZ DOCUMENTATION
, 1995
"... This document is a first introduction to programming in Oz. It is mostly written as a handson tutorial animating the reader to interactively experiment with the DFKI Oz system. Oz is a concurrent constraint programming language designed for applications that require complex symbolic computations, o ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This document is a first introduction to programming in Oz. It is mostly written as a handson tutorial animating the reader to interactively experiment with the DFKI Oz system. Oz is a concurrent constraint programming language designed for applications that require complex symbolic computations, organization into multiple agents, and soft realtime control. It is based on a new computation model providing a uniform foundation for higherorder functional programming, constraint logic programming, and concurrent objects with multiple inheritance. From functional languages Oz inherits full compositionality, and from logic languages Oz inherits logic variables and constraints (including feature and finite domain constraints). Search in Oz is encapsulated (no backtracking) and includes one, best and all solution strategies. DFKI Oz is an interactive implementation of Oz featuring a programming interface based on GNU Emacs, a concurrent browser, an objectoriented interface to Tcl/Tk, powe...
etGenielogiciel
"... iscompatiblewiththeMLcorelanguage,andisthemostexpressivetypesystemsforMLwith integratenonapplicativefeaturesandpolymorphictyping. languagediersfromML,butlendsitselfeasilytopolymorphictyping.Bothapproachessmoothly imperativefeaturesproposedsofar.Thesecondapproachreliesonswitchingto\byname"seman va ..."
Abstract
 Add to MetaCart
iscompatiblewiththeMLcorelanguage,andisthemostexpressivetypesystemsforMLwith integratenonapplicativefeaturesandpolymorphictyping. languagediersfromML,butlendsitselfeasilytopolymorphictyping.Bothapproachessmoothly imperativefeaturesproposedsofar.Thesecondapproachreliesonswitchingto\byname"seman variables),andonarenedtypingoffunctionalvalues(closuretyping).Theresultingtypesystem ticsfortheconstructsofpolymorphism,insteadoftheusual\byvalue"semantics.Theresulting Typagepolymorphed'unlangagealgorithmique auxlangagespurementapplicatifs,maisnes'etendpasnaturellementautraitprincipaldeslan Letypagestatiqueavectypespolymorphes,commedanslelangageML,s'adapteparfaitement gagesalgorithmiques:lamodicationenplacedesstructuresdedonnees.Desdicultesdety XavierLeroy pagesimilairesapparaissentavecd'autresextensionsdeslangagesapplicatifs:variableslogiques, lasemantiquerelationnelle)deuxnouvellesapprochesdutypagepolymorphedecesconstructions canauxdecommunication,manipulationsdecontinuations.Cetravailetudie(danslecadrede Resume
UNC is an Equal Opportunity/Affirmative Action Institution. Practical Higherorder Functional a nd Logic Programming based o n Lambda Calculus and Set Abstract ioni
, 1988
"... This dissertation addresses the unification of functional and logic programming. We concentrate on the role of set abstraction in this integration. The proposed approach combines the expressive power of lazy higherorder functional programming with not only firstorder Rom logic, but also a useful s ..."
Abstract
 Add to MetaCart
This dissertation addresses the unification of functional and logic programming. We concentrate on the role of set abstraction in this integration. The proposed approach combines the expressive power of lazy higherorder functional programming with not only firstorder Rom logic, but also a useful subset of higherorder Horn logic. Set abstractions take the place of Horn logic predicates. Like functions, they are firstclass objects. The denota~io nal semantics of traditional functional programming languages is based on an extended lambda calculus. Set abstractions are added to the semantic domain via angelic powerdomains, which are compatible with lazy evaluation and are welldefined over even nonflat (higherorder) domains. From the denotational equations we derive an equivalent operational semantics. A new computation rule more efficient than the paralleloutermost rule is developed and proven to be a correct computation rule for this type of language. Concepts from resolution are generalized to provide efficient computation of set abstractions. T he implementation avoids computationally explosive primitives such as
I UNC is an Equal Opportunity f Affirmative Action Institution. Unification and Setvalued Functions for Functional and Logic Programrningt
, 1987
"... \Ve propose a new approach to the integration of functional and logic languages, based on a theory of unification and setvalued functions. A setvalued function maps a tuple of input sets into an output set. We describe a language called Setlog which illustrates this approach, and give its modelth ..."
Abstract
 Add to MetaCart
\Ve propose a new approach to the integration of functional and logic languages, based on a theory of unification and setvalued functions. A setvalued function maps a tuple of input sets into an output set. We describe a language called Setlog which illustrates this approach, and give its modeltheoretic, fixedpoint, and operational semantics. The modeltheoretic semantics and fixedpoint semantics resemble that of Horn logic. The operational semantics uses outermost reduction (for setvalued functions) and unification (for terms). '\Ve establish the correctness of the operational semantics through soundness and completeness proofs.