scholarly journals BETA language Proposal as of April 1979

1979 ◽  
Vol 8 (98) ◽  
Author(s):  
Bent Bruun Kristensen ◽  
Ole Lehrmann Madsen ◽  
Birger Møller-Pedersen ◽  
Kristen Nygaard
Keyword(s):  
Programming Language ◽  
Computer Systems ◽  
Function Type ◽  
Communicating Sequential Processes ◽  
Sequential Processes ◽  
Definition Of ◽  
Language Description ◽  
Block Structured

<p>The report contains a proposal for the definition of the BETA programming language. Description of additional concepts to be included (contexts, descriptors, layers) and possible alternatives to the proposal are given.</p><p>BETA is a general block-structured language in the style of Algol, Simula, and Pascal. It is intended to be used for programming computer systems, and for defining and implementing application oriented languages.</p><p>BETA is closer to Simula than to Algol and Pascal. Procedure, function, type and class declarations have been unified into one declaration called a pattern. Objects may execute their actions independently (possibly in concurrency) and communication between them must be synchronized in a manner similar to Hoare's Communicating Sequential Processes. The notions of static subroutine, variable and constant have been unified into one concept. In contrast to Simula, BETA has possibilities for a completely static storage layout.</p>

Modelling Nondeterministic Concurrent Processes with Event Structures

1991 ◽  
Vol 14 (1) ◽  
pp. 39-73
Author(s):  
Rita Loogen ◽  
Ursula Goltz
Keyword(s):  
Dynamic Behaviour ◽  
Partially Ordered Sets ◽  
Parallel Composition ◽  
Ordered Sets ◽  
Communicating Sequential Processes ◽  
Partially Ordered ◽  
Event Structures ◽  
Transition Relation ◽  
Concurrent Processes ◽  
Sequential Processes

We present a non-interleaving model for non deterministic concurrent processes that is based on labelled event structures. We define operators on labelled event structures like parallel composition, nondeterministic combination, choice, prefixing and hiding. These operators correspond to the operations of the “Theory of Communicating Sequential Processes” (TCSP). Infinite processes are defined using the metric approach. The dynamic behaviour of event structures is defined by a transition relation which describes the execution of partially ordered sets of actions, abstracting from internal events.

Cubical Agda: A dependently typed programming language with univalence and higher inductive types

2021 ◽  
Vol 31 ◽  
Author(s):  
ANDREA VEZZOSI ◽  
ANDERS MÖRTBERG ◽  
ANDREAS ABEL
Keyword(s):  
Programming Language ◽  
Type Theory ◽  
Type Checking ◽  
Dependent Type Theory ◽  
Wide Range ◽  
General Schema ◽  
Direct Definition ◽  
Inductive Types ◽  
Definition Of ◽  
Cubical Type Theory

Abstract Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major implementations lack powerful extensionality principles for reasoning about equality, such as function and propositional extensionality. These principles are typically added axiomatically which disrupts the constructive properties of these systems. Cubical type theory provides a solution by giving computational meaning to Homotopy Type Theory and Univalent Foundations, in particular to the univalence axiom and higher inductive types (HITs). This paper describes an extension of the dependently typed functional programming language Agda with cubical primitives, making it into a full-blown proof assistant with native support for univalence and a general schema of HITs. These new primitives allow the direct definition of function and propositional extensionality as well as quotient types, all with computational content. Additionally, thanks also to copatterns, bisimilarity is equivalent to equality for coinductive types. The adoption of cubical type theory extends Agda with support for a wide range of extensionality principles, without sacrificing type checking and constructivity.

Research and Development for Makeup Object Moderl Agent Layer about XML Standard of Profession Field

2011 ◽  
Vol 314-316 ◽  
pp. 2152-2157
Author(s):  
Huan Gu
Keyword(s):  
Research And Development ◽  
Programming Language ◽  
Language Model ◽  
Digital System ◽  
Data Type ◽  
Definition Of

This document explains and demonstrates how to construct JDF data agent tools on .NET Linq platform. This Agent has the ability to create a Job, to add Nodes to an existing Job, and to modify existing Nodes. It is based on the structure of JDF standard and the definition of markup, and packages the node of each layer and its complicated parameters and data type into the object, forming a programming language model that is based on JDF markup object, and reducing the complexity of developing the printing digital process software basing-on JDFXML standard, providing a reference for developing the same distributed digital system basing-on XML driver.

scholarly journals Learners Programming Language a Helping System for Introductory Programming Courses

2016 ◽  
Vol 35 (3) ◽  
pp. 347-358
Author(s):  
Muhammad Shumail Naveed ◽  
Muhammad Sarim ◽  
Kamran Ahsan
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Retention Rate ◽  
Introductory Programming ◽  
Source Program ◽  
Definition Of ◽  
High Level ◽  
Novice Students ◽  
Introductory Programming Courses ◽  
Programming Courses

Programming is the core of computer science and due to this momentousness a special care is taken in designing the curriculum of programming courses. A substantial work has been conducted on the definition of programming courses, yet the introductory programming courses are still facing high attrition, low retention and lack of motivation. This paper introduced a tiny pre-programming language called LPL (Learners Programming Language) as a ZPL (Zeroth Programming Language) to illuminate novice students about elementary concepts of introductory programming before introducing the first imperative programming course. The overall objective and design philosophy of LPL is based on a hypothesis that the soft introduction of a simple and paradigm specific textual programming can increase the motivation level of novice students and reduce the congenital complexities and hardness of the first programming course and eventually improve the retention rate and may be fruitful in reducing the dropout/failure level. LPL also generates the equivalent high level programs from user source program and eventually very fruitful in understanding the syntax of introductory programming languages. To overcome the inherent complexities of unusual and rigid syntax of introductory programming languages, the LPL provide elementary programming concepts in the form of algorithmic and plain natural language based computational statements. The initial results obtained after the introduction of LPL are very encouraging in motivating novice students and improving the retention rate.

scholarly journals Communicating sequential processes

1983 ◽  
Vol 26 (1) ◽  
pp. 100-106 ◽  
Author(s):  
C. A. R. Hoare
Keyword(s):  
Communicating Sequential Processes ◽  
Sequential Processes

Communicating sequential processes for distributed constraint satisfaction

2006 ◽  
Vol 176 (5) ◽  
pp. 490-521 ◽  
Author(s):  
Ilias Sakellariou ◽  
Ioannis Vlahavas ◽  
Ivan Futo ◽  
Zoltan Pasztor ◽  
Janos Szeredi
Keyword(s):  
Constraint Satisfaction ◽  
Communicating Sequential Processes ◽  
Distributed Constraint Satisfaction ◽  
Sequential Processes
Sign in / Sign up

Export Citation Format

Share Document