CHR(PRISM)-based probabilistic logic learning

AbstractPRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules.In this paper, we introduce a new probabilistic logic formalism, called CHRiSM, based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models by means of “chance rules”. The underlying PRISM system can then be used for several probabilistic inference tasks, including probability computation and parameter learning. We define the CHRiSM language in terms of syntax and operational semantics, and illustrate it with examples. We define the notion of ambiguous programs and define a distribution semantics for unambiguous programs. Next, we describe an implementation of CHRiSM, based on CHR(PRISM). We discuss the relation between CHRiSM and other probabilistic logic programming languages, in particular PCHR. Finally, we identify potential application domains.

Download Full-text

Learners Programming Language a Helping System for Introductory Programming Courses

Mehran University Research Journal of Engineering and Technology ◽

10.22581/muet1982.1603.05 ◽

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.

Download Full-text

Tree-Shaped Formats of Address Programming Language

NaUKMA Research Papers Computer Science ◽

10.18523/2617-3808.2021.4.78-87 ◽

2021 ◽

Vol 4 ◽

pp. 78-87

Author(s):

Yury Yuschenko

Keyword(s):

Programming Languages ◽

Programming Language ◽

Theoretical Research ◽

Direct Access ◽

Complex Data ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data ◽

The One ◽

High Level

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of “review scheme” is defined, which is like the concept of “bypassing” trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on “stroke-operation” (pointer dereference), which was hardware implemented in the command system of computer “Kyiv”. Group operations of modernization of computer “Kyiv” addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer “Kyiv”, due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer “Kyiv” allow direct access to the i-th element of the “list” by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.

Download Full-text

The ins and outs of Clean I/O

Journal of Functional Programming ◽

10.1017/s0956796800001258 ◽

1995 ◽

Vol 5 (1) ◽

pp. 81-110 ◽

Cited By ~ 28

Author(s):

Peter Achten ◽

Rinus Plasmeijer

Keyword(s):

Programming Languages ◽

Programming Language ◽

Functional Programming ◽

Data Types ◽

Spreadsheet Program ◽

Functional Programming Languages ◽

Hard Time ◽

Functional Programming Language ◽

Algebraic Data Types ◽

High Level

AbstractFunctional programming languages have banned assignment because of its undesirable properties. The reward of this rigorous decision is that functional programming languages are side-effect free. There is another side to the coin: because assignment plays a crucial role in Input/Output (I/O), functional languages have a hard time dealing with I/O. Functional programming languages have therefore often been stigmatised as inferior to imperative programming languages because they cannot deal with I/O very well. In this paper, we show that I/O can be incorporated in a functional programming language without loss of any of the generally accepted advantages of functional programming languages. This discussion is supported by an extensive account of the I/O system offered by the lazy, purely functional programming language Clean. Two aspects that are paramount in its I/O system make the approach novel with respect to other approaches. These aspects are the technique of explicit multiple environment passing, and the Event I/O framework to program Graphical User I/O in a highly structured and high-level way. Clean file I/O is as powerful and flexible as it is in common imperative languages (one can read, write, and seek directly in a file). Clean Event I/O provides programmers with a high-level framework to specify complex Graphical User I/O. It has been used to write applications such as a window-based text editor, an object based drawing program, a relational database, and a spreadsheet program. These graphical interactive programs are completely machine independent, but still obey the look-and-feel of the concrete window environment being used. The specifications are completely functional and make extensive use of uniqueness typing, higher-order functions, and algebraic data types. Efficient implementations are present on the Macintosh, Sun (X Windows under Open Look) and PC (OS/2).

Download Full-text

Implementing type theory in higher order constraint logic programming

Mathematical Structures in Computer Science ◽

10.1017/s0960129518000427 ◽

2019 ◽

Vol 29 (8) ◽

pp. 1125-1150

Author(s):

FERRUCCIO GUIDI ◽

CLAUDIO SACERDOTI COEN ◽

ENRICO TASSI

Keyword(s):

Programming Languages ◽

Programming Language ◽

Type System ◽

Theorem Prover ◽

Type Checking ◽

Language Extension ◽

Order Constraint ◽

Simple Implementation ◽

Calculus Of Inductive Constructions ◽

High Level

In this paper, we are interested in high-level programming languages to implement the core components of an interactive theorem prover for a dependently typed language: the kernel – responsible for type-checking closed terms – and the elaborator – that manipulates open terms, that is terms containing unresolved unification variables.In this paper, we confirm that λProlog, the language developed by Miller and Nadathur since the 80s, is extremely suitable for implementing the kernel. Indeed, we easily obtain a type checker for the Calculus of Inductive Constructions (CIC). Even more, we do so in an incremental way by escalating a checker for a pure type system to the full CIC.We then turn our attention to the elaborator with the objective to obtain a simple implementation thanks to the features of the programming language. In particular, we want to use λProlog’s unification variables to model the object language ones. In this way, scope checking, carrying of assignments and occur checking are handled by the programming language.We observe that the eager generative semantics inherited from Prolog clashes with this plan. We propose an extension to λProlog that allows to control the generative semantics, suspend goals over flexible terms turning them into constraints, and finally manipulate these constraints at the meta-meta level via constraint handling rules.We implement the proposed language extension in the Embedded Lambda Prolog Interpreter system and we discuss how it can be used to extend the kernel into an elaborator for CIC.

Download Full-text

Acute: High-level programming language design for distributed computation

Journal of Functional Programming ◽

10.1017/s0956796807006442 ◽

2007 ◽

Vol 17 (4-5) ◽

pp. 547-612 ◽

Cited By ~ 22

Author(s):

PETER SEWELL ◽

JAMES J. LEIFER ◽

KEITH WANSBROUGH ◽

FRANCESCO ZAPPA NARDELLI ◽

MAIR ALLEN-WILLIAMS ◽

...

Keyword(s):

Programming Language ◽

Distributed System ◽

Operational Semantics ◽

Module Structure ◽

Distributed Programming ◽

Type Safety ◽

Programming Language Design ◽

Local Resources ◽

Definition Of ◽

High Level

AbstractExisting languages provide good support for typeful programming of stand-alone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper, we discuss programming-language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately built programs. The main features are (1) type-safe marshalling of arbitrary values; (2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system; (3) expression-level names generated to ensure that name equality tests suffice for type safety of associated values, for example, values carried on named channels; (4) controlled dynamic rebinding of marshalled values to local resources; and (5) thunkification of threads and mutexes to support computation mobility. These features are a large part of what is needed for typeful distributed programming. They are a relatively lightweight extension of ML, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. This disentangles the language run-time from communication intricacies. This paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

Download Full-text

Pembangunan Perangkat Lunak PuniEdit (Perangkat Lunak Editor untuk Multi Language Programming)

10.31227/osf.io/f4v25 ◽

2019 ◽

Author(s):

Budiman

Keyword(s):

Programming Languages ◽

Programming Language ◽

Source Code ◽

Computer Software ◽

Object Oriented ◽

Object Oriented Programming ◽

Text Editor ◽

Development Environment ◽

Integrated Development ◽

High Level

During this period continued to develop computer software, programming language was no exception. At the start of the era of low level programming languages, then developed a high level programming language. It is characterized by the appearance of a method of programming offered by a programming language, that is, object-oriented programming (OOP). IDE (Integrated Development Environment) is a computer program that has some facilities that are required in the development of the software. The purpose of the IDEA is to provide all the necessary utilities in building software. As for the type of software text editor that can be used to manipulate the source code hereinafter referred to as the source code of programming languages such as Ultraedit, JediEdit, ClearEdit, cEdit, the Golden Pen, and so on. PuniEdit software is a text-based editor software that can simplify the user through correction, insertion, and modification of the source code. PuniEdit software is built using Borland Delphi 7.0 and SynEdit component. This software can be used for the Pascal programming language, C++ and HTML. In addition, the software PuniEdit can perform management of the token. This PuniEdit software, the user can clearly see every occurrence of the type of token as keywords (reserved word), identifier, operator, and so on.Keywords: Source code, programming language, source code is scanned.

Download Full-text

Learning Distributional Programs for Relational Autocompletion

Theory and Practice of Logic Programming ◽

10.1017/s1471068421000144 ◽

2021 ◽

pp. 1-34

Author(s):

NITESH KUMAR ◽

ONDŘEJ KUŽELKA ◽

LUC DE RAEDT

Keyword(s):

Missing Data ◽

Expectation Maximization ◽

Statistical Models ◽

Missing Values ◽

Probability Distributions ◽

Rule Learning ◽

Relational Data ◽

Probabilistic Logic ◽

Programming Framework ◽

Distinguishing Features

Abstract Relational autocompletion is the problem of automatically filling out some missing values in multi-relational data. We tackle this problem within the probabilistic logic programming framework of Distributional Clauses (DCs), which supports both discrete and continuous probability distributions. Within this framework, we introduce DiceML – an approach to learn both the structure and the parameters of DC programs from relational data (with possibly missing data). To realize this, DiceML integrates statistical modeling and DCs with rule learning. The distinguishing features of DiceML are that it (1) tackles autocompletion in relational data, (2) learns DCs extended with statistical models, (3) deals with both discrete and continuous distributions, (4) can exploit background knowledge, and (5) uses an expectation–maximization-based (EM) algorithm to cope with missing data. The empirical results show the promise of the approach, even when there is missing data.

Download Full-text

Structural Operational Semantics

BRICS Report Series ◽

10.7146/brics.v6i30.20099 ◽

1999 ◽

Vol 6 (30) ◽

Cited By ~ 3

Author(s):

Luca Aceto ◽

Willem Jan Fokkink ◽

Chris Verhoef

Keyword(s):

Programming Languages ◽

Operational Semantics ◽

The Sixties ◽

Structural Operational Semantics ◽

High Level

The importance of giving precise semantics to programming and specification languages was recognized since the sixties with the development of the first high-level programming languages (cf. e.g. [30, 206] for some early accounts). The use of operational semantics - i.e. of a semantics that explicitly describes how programs compute in stepwise fashion, and the possible state-transformations they perform - was already advocated by McCarthy in [147], and elaborated upon in references like [142, 143]. Examples of full-blown languages that have been endowed with an operational semantics are Algol 60 [140], PL/I [173], and CSP [178].

Download Full-text

Analyzing User Experience of Website for the Learning of Programming Language

Jurnal Edukasi dan Penelitian Informatika (JEPIN) ◽

10.26418/jp.v6i1.40000 ◽

2020 ◽

Vol 6 (1) ◽

pp. 1

Author(s):

Derisma Derisma

Keyword(s):

Data Processing ◽

Programming Languages ◽

Programming Language ◽

User Experience ◽

Measurement Method ◽

Efficiency Score ◽

Learning Effectiveness ◽

Programming Framework ◽

High Level ◽

Experience Questionnaire

User experience is a term for the experience of users in having an easiness and efficiency in the interaction between humans and computers. CodeSaya is an easy, fun, and free place to learn about coding. There are some Programming Languages which can be learned. This research aimed to analyze the effectiveness of the codesaya.com website to learn the basics of programming by using a measurement method of the User Experience Questionnaire (UEQ). There are six examined scales, namely attractiveness, perspicuity, efficiency, dependability, stimulation, and novelty. The testing results showed that those six scales positively affected the students' attentions to use the programming framework with 1.722 of attractiveness score, 1.456 of perspicuity score, 1.718 of efficiency score, 1.46 of dependability score, and 1.44 of stimulation score, these scores showed that the five scales were at a high level, while novelty was at a moderate level with 1.147 of the score. According to the whole data processing and analysis were done in this study, it can be concluded that CodeSaya Website can improve the learning effectiveness of Programming Languages.

Download Full-text

A formalism for the specification of essentially-algebraic structures in 2-categories

Mathematical Structures in Computer Science ◽

10.1017/s0960129500001110 ◽

1992 ◽

Vol 2 (1) ◽

pp. 1-28 ◽

Cited By ~ 3

Author(s):

A. J. Power ◽

Charles Wells

Keyword(s):

Programming Languages ◽

Functional Programming ◽

Operational Semantics ◽

Higher Order ◽

Two Dimensional ◽

Functional Programming Languages ◽

One Dimensional ◽

Special Cases ◽

Rewrite Rules ◽

Definition Of

A type of higher-order two-dimensional sketch is defined which has models in suitable 2-categories. It has as special cases the ordinary sketches of Ehresmann and certain previously defined generalizations of one-dimensional sketches. These sketches allow the specification of constructions in 2-categories such as weighted limits, as well as higher-order constructions such as exponential objects and subobject classifiers, that cannot be sketched by limits and colimits. These sketches are designed to be the basis of a category-based methodology for the description of functional programming languages, complete with rewrite rules giving the operational semantics, that is independent of the usual specification methods based on formal languages and symbolic logic. A definition of ‘path grammar’, generalizing the usual notion of grammar, is given as a step towards this goal.

Download Full-text