Formal Definition of an Agent-Object Programming Language

Author(s):  
F. Pagliarecci ◽  
L. Spalazzi ◽  
G. Capuzzi
2003 ◽  
Vol 38 (8) ◽  
pp. 20-21 ◽  
Author(s):  
C. Pronk ◽  
M. Schönhacker

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-26
Author(s):  
Artem Pelenitsyn ◽  
Julia Belyakova ◽  
Benjamin Chung ◽  
Ross Tate ◽  
Jan Vitek

As a scientific programming language, Julia strives for performance but also provides high-level productivity features. To avoid performance pathologies, Julia users are expected to adhere to a coding discipline that enables so-called type stability. Informally, a function is type stable if the type of the output depends only on the types of the inputs, not their values. This paper provides a formal definition of type stability as well as a stronger property of type groundedness, shows that groundedness enables compiler optimizations, and proves the compiler correct. We also perform a corpus analysis to uncover how these type-related properties manifest in practice.


2021 ◽  
Vol 31 ◽  
Author(s):  
ANDREA VEZZOSI ◽  
ANDERS MÖRTBERG ◽  
ANDREAS ABEL

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.


2021 ◽  
Vol 1752 (1) ◽  
pp. 012082
Author(s):  
Nurdin ◽  
S F Assagaf ◽  
F Arwadi

2014 ◽  
Vol 532 ◽  
pp. 113-117
Author(s):  
Zhou Jin ◽  
Ru Jing Wang ◽  
Jie Zhang

The rotating machineries in a factory usually have the characteristics of complex structure and highly automated logic, which generated a large amounts of monitoring data. It is an infeasible task for uses to deal with the massive data and locate fault timely. In this paper, we explore the causality between symptom and fault in the context of fault diagnosis in rotating machinery. We introduce data mining into fault diagnosis and provide a formal definition of causal diagnosis rule based on statistic test. A general framework for diagnosis rule discovery based on causality is provided and a simple implementation is explored with the purpose of providing some enlightenment to the application of causality discovery in fault diagnosis of rotating machinery.


2011 ◽  
Vol 314-316 ◽  
pp. 2152-2157
Author(s):  
Huan Gu

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.


Viruses ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 569 ◽  
Author(s):  
Lize Cuypers ◽  
Pieter Libin ◽  
Peter Simmonds ◽  
Ann Nowé ◽  
Jorge Muñoz-Jordán ◽  
...  

Dengue virus (DENV) is estimated to cause 390 million infections per year worldwide. A quarter of these infections manifest clinically and are associated with a morbidity and mortality that put a significant burden on the affected regions. Reports of increased frequency, intensity, and extended geographical range of outbreaks highlight the virus’s ongoing global spread. Persistent transmission in endemic areas and the emergence in territories formerly devoid of transmission have shaped DENV’s current genetic diversity and divergence. This genetic layout is hierarchically organized in serotypes, genotypes, and sub-genotypic clades. While serotypes are well defined, the genotype nomenclature and classification system lack consistency, which complicates a broader analysis of their clinical and epidemiological characteristics. We identify five key challenges: (1) Currently, there is no formal definition of a DENV genotype; (2) Two different nomenclature systems are used in parallel, which causes significant confusion; (3) A standardized classification procedure is lacking so far; (4) No formal definition of sub-genotypic clades is in place; (5) There is no consensus on how to report antigenic diversity. Therefore, we believe that the time is right to re-evaluate DENV genetic diversity in an essential effort to provide harmonization across DENV studies.


Sign in / Sign up

Export Citation Format

Share Document