A Shell-like Model for General Purpose Programming

• Jeanine, Miller Adkisson

• Hidehiko, Masuhara

• Johannes, Westlund

抄録

Shell languages such as bash are designed to integrate with an OS, which mainly involves managing processes with implicit input and output streams. They also attempt to do this in a compact way that could be reasonably typed on a command-line interface. However, existing shell languages are not sufficient to serve as general-purpose languages - values are not observable except in raw streams of bytes, and they lack modern language features such as lexical scope and higher-order functions. By way of a new programming language, Magritte, we propose a general-purpose programming language with semantics similar to bash. In this presentation, we discuss the early design of such a system, in which the primary unit of composition, like bash, is processes with asynchronous inputs and outputs, which can be read from or written to at any time, and which can be chained together via a pipe operator. We also explore concurrency semantics for such a language. We explore the implementation and design challenges that come with such a model, and also show that this model is able to easily create and compose concurrent algorithms.

Shell languages such as bash are designed to integrate with an OS, which mainly involves managing processes with implicit input and output streams. They also attempt to do this in a compact way that could be reasonably typed on a command-line interface. However, existing shell languages are not sufficient to serve as general-purpose languages - values are not observable except in raw streams of bytes, and they lack modern language features such as lexical scope and higher-order functions. By way of a new programming language, Magritte, we propose a general-purpose programming language with semantics similar to bash. In this presentation, we discuss the early design of such a system, in which the primary unit of composition, like bash, is processes with asynchronous inputs and outputs, which can be read from or written to at any time, and which can be chained together via a pipe operator. We also explore concurrency semantics for such a language. We explore the implementation and design challenges that come with such a model, and also show that this model is able to easily create and compose concurrent algorithms.

収録刊行物

• 情報処理学会論文誌プログラミング（PRO）

  情報処理学会論文誌プログラミング（PRO） 12 (3), 12-12, 2019-07-17

  ACM

キーワード

• [発表概要，Unrefereed Presentation Abstract]

詳細情報

• CRID: 1050282813364730496
• NII論文ID: 170000150473
• NII書誌ID: AA11464814
• ISSN: 18827802
• DOI: 10.1145/3328433.3328444
• Web Site: http://id.nii.ac.jp/1001/00198113/
• Web Site: https://dl.acm.org/doi/pdf/10.1145/3328433.3328444
• 本文言語コード: en
• 資料種別: article
• データソース種別:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN