scholarly journals An axiomatic definition of the programming language PASCAL

1974 ◽  
pp. 1-16 ◽  
Author(s):  
C. A. R. Hoare
Keyword(s):  
Programming Language ◽  
Axiomatic Definition ◽  
Definition Of

scholarly journals An axiomatic definition of the programming language PASCAL

1973 ◽  
Vol 2 (4) ◽  
pp. 335-355 ◽  
Author(s):  
C. A. R. Hoare ◽  
N. Wirth
Keyword(s):  
Programming Language ◽  
Axiomatic Definition ◽  
Definition Of

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.

Migrating JAVA to Mobile Platforms through HAXE

2016 ◽  
pp. 240-268 ◽  
Author(s):  
Pablo Nicolás Díaz Bilotto ◽  
Liliana Favre
Keyword(s):  
Programming Language ◽  
Mobile Applications ◽  
Software Evolution ◽  
Wide Spectrum ◽  
The Other ◽  
Model Transformations ◽  
Mobile Platforms ◽  
Model Driven ◽  
Definition Of ◽  
High Level

Software developers face several challenges in deploying mobile applications. One of them is the high cost and technical complexity of targeting development to a wide spectrum of platforms. The chapter proposes to combine techniques based on MDA (Model Driven Architecture) with the HaXe language. The outstanding ideas behind MDA are separating the specification of the system functionality from its implementation on specific platforms, managing the software evolution, increasing the degree of automation of model transformations, and achieving interoperability with multiple platforms. On the other hand, HaXe is a very modern high level programming language that allows us to generate mobile applications that target all major mobile platforms. The main contributions of this chapter are the definition of a HaXe metamodel, the specification of a model-to-model transformation between Java and HaXe and, the definition of an MDA migration process from Java to mobile platforms.

scholarly journals Quasi-Perfect Stackelberg Equilibrium

2019 ◽  
Vol 33 ◽  
pp. 2117-2124 ◽  
Author(s):  
Alberto Marchesi ◽  
Gabriele Farina ◽  
Christian Kroer ◽  
Nicola Gatti ◽  
Tuomas Sandholm
Keyword(s):  
Broad Class ◽  
Stackelberg Equilibrium ◽  
Correlated Equilibrium ◽  
Equilibrium Concept ◽  
Extensive Form ◽  
Tree Form ◽  
Axiomatic Definition ◽  
Security Games ◽  
Definition Of ◽  
Perfect Equilibria

Equilibrium refinements are important in extensive-form (i.e., tree-form) games, where they amend weaknesses of the Nash equilibrium concept by requiring sequential rationality and other beneficial properties. One of the most attractive refinement concepts is quasi-perfect equilibrium. While quasiperfection has been studied in extensive-form games, it is poorly understood in Stackelberg settings—that is, settings where a leader can commit to a strategy—which are important for modeling, for example, security games. In this paper, we introduce the axiomatic definition of quasi-perfect Stackelberg equilibrium. We develop a broad class of game perturbation schemes that lead to them in the limit. Our class of perturbation schemes strictly generalizes prior perturbation schemes introduced for the computation of (non-Stackelberg) quasi-perfect equilibria. Based on our perturbation schemes, we develop a branch-and-bound algorithm for computing a quasi-perfect Stackelberg equilibrium. It leverages a perturbed variant of the linear program for computing a Stackelberg extensive-form correlated equilibrium. Experiments show that our algorithm can be used to find an approximate quasi-perfect Stackelberg equilibrium in games with thousands of nodes.

scholarly journals DEFORMATION CONDITIONS FOR PSEUDOREPRESENTATIONS

2019 ◽  
Vol 7 ◽  
Author(s):  
PRESTON WAKE ◽  
CARL WANG-ERICKSON
Keyword(s):  
Stability Condition ◽  
Deformation Theory ◽  
Axiomatic Definition ◽  
Galois Deformation ◽  
Definition Of

Given a property of representations satisfying a basic stability condition, Ramakrishna developed a variant of Mazur’s Galois deformation theory for representations with that property. We introduce an axiomatic definition of pseudorepresentations with such a property. Among other things, we show that pseudorepresentations with a property enjoy a good deformation theory, generalizing Ramakrishna’s theory to pseudorepresentations.

Definition of the semantics of programming language constructs in terms of ?-calculus. I

Cybernetics ◽  
1982 ◽  
Vol 17 (5) ◽  
pp. 590-595
Author(s):  
V. N. Domrachev ◽  
Yu. V. Kapitonova ◽  
L. G. Samoilenko
Keyword(s):  
Programming Language ◽  
Language Constructs ◽  
Calculus I ◽  
Definition Of

Some remarks on axiomatic definition of entropy measure

2017 ◽  
Vol 33 (3) ◽  
pp. 1945-1952 ◽  
Author(s):  
Krzysztof Piasecki
Keyword(s):  
Entropy Measure ◽  
Axiomatic Definition ◽  
Definition Of

Formal definition of programming language standards

2003 ◽  
Vol 38 (8) ◽  
pp. 20-21 ◽  
Author(s):  
C. Pronk ◽  
M. Schönhacker
Keyword(s):  
Programming Language ◽  
Formal Definition ◽  
Definition Of
Sign in / Sign up

Export Citation Format

Share Document