Functional Programming and Operating Systems

Jones, Simon B.; Sinclair, A. F.

doi:10.1093/comjnl/32.2.162

Cited by 14 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mature implementations of IO interfaces are therefore based on synchronous processing, consuming response streams to produce request streams, in a productive or contractive fashion. Some early functional operating systems [11] also used streams (sometimes in a ring) for communication among system processes.…”

Section: Conclusion Related Workmentioning

confidence: 99%

Representations of Stream Processors Using Nested Fixed Points

Hancock¹,

Pattinson²,

Ghani³

2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation on the representations of two continuous functions between streams that yields a representation of their composite.In the case of discrete-valued functions, the representatives are well-founded (finitepath) trees of a certain kind. The underlying idea can be traced back to Brouwer's justification of bar-induction, or to Kreisel and Troelstra's elimination of choice-sequences. In the case of stream-valued functions, the representatives are non-wellfounded trees pieced together in a coinductive fashion from well-founded trees. The definition requires an alternating fixpoint construction of some ubiquity.

show abstract

Section: Conclusion Related Workmentioning

confidence: 99%

Representations of Stream Processors Using Nested Fixed Points

Hancock¹,

Pattinson²,

Ghani³

2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…Operating systems are inherently reactive and provide the archetypical example of large reactive systems. 9,10 The term reactive is more specific than the informal term event-driven, which is widely used and overloaded. For instance, an event-driven program may calculate a simple transformation and terminate.…”

Section: Reactive Systemsmentioning

confidence: 99%

“…9 Logic programming approaches have fared little better. Concurrent Prolog was expressly designed for systems programming and provided dataflow-style synchronization via nondeterministic guarded-commands as its basic control mechanism.…”

Section: General Observationsmentioning

confidence: 99%

Synchronous/Reactive Programming of Concurrent System Software

Montague

McDowell

1997

Softw: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYSynchronous languages are intended for programming reactive systems. Reactive systems, which include real-time systems and key operating system components, interact continually with their environment. This paper considers the applicability of imperative synchronous/reactive languages to the development of general system software, that is, to the implementation of operating system kernels, file systems, databases,networks, server architectures, device drivers, etc. The languages Esterel and Reactive C (RC) receive special attention as Esterel is the oldest and most developed such language and RC is specifically designed for compatibility with C systems programming. An alternative soft-instruction software architecture is described, which is well suited to real-world system programming.

show abstract

“…The functional implementation of operating systems is described in Karlsson (1981), Henderson (1982), Jones (1984) and Stoye (1986). The work of Jones and Sinclair (1989) contains an overview of these and other approaches.…”

Section: Introductionmentioning

confidence: 99%

Modelling operating system structures by timed stream processing functions

Broy

Dendorfer

1992

J. Funct. Prog.

View full text Add to dashboard Cite

Some extensions of the basic formalism of stream processing functions are useful to specify complex structures such as operating systems. In this paper we give the foundations of higher order stream processing functions. These are functions which send and accept not only messages representing atomic data, but also complex elements such as functions. Some special notations are introduced for the specification and manipulation of such functions. A representation of time is outlined, which enables us to model time dependent behaviour. Finally, we demonstrate how characteristic operating system structures can be modelled by timed higher order stream processing functions.

show abstract

Functional Programming and Operating Systems

Cited by 14 publications

References 0 publications

Representations of Stream Processors Using Nested Fixed Points

Representations of Stream Processors Using Nested Fixed Points

Synchronous/Reactive Programming of Concurrent System Software

Modelling operating system structures by timed stream processing functions

Contact Info

Product

Resources

About