Filters








411 Hits in 4.5 sec

Intersection types and runtime errors in the pi-calculus

Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
We introduce a type system for the π -calculus which is designed to guarantee that typable processes are well-behaved, namely they never produce a run-time error and, even if they may diverge, there is  ...  The introduced type system is based on non-idempotent intersections, and is thus very powerful as for the class of processes it can capture.  ...  ACKNOWLEDGMENTS This work was partially supported by ANR grants Elica (ANR-14-CE25-0005) and Repas (ANR-16-CE25-0011), and INRIA/JSPS EA Crecogi.  ... 
doi:10.1145/3290320 fatcat:ntk7ezw22feujcoz3w3cx4fsae

Revisiting Elementary Denotational Semantics [article]

Jeremy G. Siek
2017 arXiv   pre-print
Toward scaling elementary models to larger languages, we formulate our semantics in a monadic style, give a semantics for System F with general recursion, and mechanize the proof of type soundness.  ...  However, there are elementary models of the λ-calculus that are much less complex: by Coppo, Dezani-Ciancaglini, and Salle (1979), Engeler (1981), and Plotkin (1993).  ...  First, we add a wrong value to represent a runtime type error so that we can prove that "well-typed programs cannot go wrong" in the tradition of Milner (1978) .  ... 
arXiv:1707.03762v2 fatcat:hzxefhguxvhf5hx3sm5n6bvpcy

Dynamic Access Control in a Concurrent Object Calculus [chapter]

Avik Chaudhuri
2006 Lecture Notes in Computer Science  
We investigate safe administration and access of shared resources in the resulting language.  ...  We develop a variant of Gordon and Hankin's concurrent object calculus with support for flexible access control on methods.  ...  Martín Abadi suggested concς as a possible starting point for the calculus. In addition, he and Cormac Flanagan helped with comments on an earlier draft.  ... 
doi:10.1007/11817949_18 fatcat:ilqwu2uebve3rc3ivcki5lsjpq

A Core Calculus for XQuery 3.0 [chapter]

Giuseppe Castagna, Hyeonseung Im, Kim Nguyễn, Véronique Benzaken
2015 Lecture Notes in Computer Science  
We prove the soundness of the operators π1, π2, rm, cons, and snoc by exploiting the fact that the types in the domains of their corresponding typing functions (especially for cons and snoc) are more precise  ...  Our core calculus equipped with O is sound in the sense that for any expression e, if e : t, then e ; * Ω. Proof. The result follows from Theorems E.20 and E.22.  ...  representing a runtime error.  ... 
doi:10.1007/978-3-662-46669-8_10 fatcat:sv6vbe6ljfb7rfjuw7u6rifcxq

Theory and Applications of Behavioural Types (Dagstuhl Seminar 17051)

Simon Gay, Vasco T. Vasconcelos, Philip Wadler, Nobuko Yoshida, Marc Herbstritt
2017 Dagstuhl Reports  
Behavioural types describe the dynamic aspects of programs, in contrast to data types, which describe the fixed structure of data.  ...  This report documents the programme and the outcomes of Dagstuhl Seminar 17051 "Theory and Applications of Behavioural Types".  ...  We propose an alternative approach to the study of type-based (dead)lock analysis in the context of the linear pi-calculus.  ... 
doi:10.4230/dagrep.7.1.158 dblp:journals/dagstuhl-reports/GayVWY17 fatcat:nl4mfyez5bchrdomocb6qsfpkq

Type Inference to Optimize a Hybrid Statically and Dynamically Typed Language

F. Ortin
2011 Computer journal  
In contrast, statically typed languages have undeniable advantages such as early type error detection and more opportunities for compiler optimizations.  ...  In this paper we present the minimal core of StaDyn, a hybrid typing language that performs static type inference of both statically and dynamically typed references.  ...  In contrast, C# 4.0 compiles the code and the error is produced at runtime (line 70 in Figure 1 ).  ... 
doi:10.1093/comjnl/bxr067 fatcat:4ujsgqpfbrfaff6qwsrkqu5fyi

Static Race Detection and Mutex Safety and Liveness for Go Programs

Julia Gabet, Nobuko Yoshida, Tobias Pape, Robert Hirschfeld
2020 European Conference on Object-Oriented Programming  
We represent these properties of programs in a μ-calculus model of types, and validate them using type-level model-checking.  ...  In this paper, we develop a theory based on behavioural types to statically detect data races and deadlocks in Go programs.  ...  Figure 8 8 ti),xi :σi,ỹi :ti Pi Ti Γ, X1(σ1,t1), . . . , Xn(σn,tn) Q S Γ {Xi(xi,ỹi) = Pi}i∈I in Q {tX i (ỹi) = Ti}i∈I in S Typing Rules for Shared Variables and Mutexes.  ... 
doi:10.4230/lipics.ecoop.2020.4 dblp:conf/ecoop/GabetY19 fatcat:aphtsgm6ifhp3dolwi7npqhopa

Resource Access Control in Systems of Mobile Agents

Matthew Hennessy, James Riely
2002 Information and Computation  
Using this tagged language we define access violations as runtime errors and prove that well-typed systems are incapable of such errors.  ...  We describe a typing system for a distributed π-calculus which guarantees that distributed agents cannot access the resources of a system without first being granted the capability to do so.  ...  The "type extrusion" example, given in the conclusion, was developed during a discussion with Peter Sewell.  ... 
doi:10.1006/inco.2001.3089 fatcat:vlbtsgsqrvb7tcqpjcmuwp3oju

PiDuce — A project for experimenting Web services technologies

Samuele Carpineti, Cosimo Laneve, Luca Padovani
2009 Science of Computer Programming  
control constructs that are based on Milner's asynchronous pi calculus.  ...  We thoroughly describe the PiDuce project: the programming language and its semantics, the architecture of the distributed runtime and its implementation.  ...  While process calculi such as pi calculus or the join calculus allow the sending and receiving of names (i.e.  ... 
doi:10.1016/j.scico.2009.03.002 fatcat:adg4f2tr4zhi5entwoizpuyyrm

Gradual session types

ATSUSHI IGARASHI, PETER THIEMANN, YUYA TSUDA, VASCO T. VASCONCELOS, PHILIP WADLER
2019 Journal of functional programming  
However, web-based applications and microservices are often written in a mix of languages, with type disciplines in a spectrum between static and dynamic typing.  ...  The interplay of linearity and dynamic types requires a novel approach to specifying the dynamics of the language.  ...  We are also grateful to Hannes Saffrich for implementing a type checker for the calculus in this paper.  ... 
doi:10.1017/s0956796819000169 fatcat:ljff7qd24vfglozbyjkpnbi4vq

Soft typing with conditional types

Alexander Aiken, Edward L. Wimmers, T. K. Lakshman
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive  ...  We demonstrate the power and practicality of the method with examples and performance results from an implementation.  ...  A program is well-typed if it is provable that the program is free of runtime type errors.  ... 
doi:10.1145/174675.177847 dblp:conf/popl/AikenWL94 fatcat:m2jeik33sbazdioy2tsznto2jy

BOEM: A Model for Automating Detection and Evolution of Distributed Ontologies in Multi-Agent Environment

Ashraf Soliman, Akram Salah, Hesham Hefny
2017 International Journal of Intelligent Engineering and Systems  
Knowledge gives a strong support to autonomous agents in multi-agent systems and thus the evolution of agent's knowledge needs a great attention since it has a control on agents' behaviors and has effect  ...  One of its results shows that an empty internal ontology of one agent could evolve automatically in runtime by 88.3% through its interactions with other agents.  ...  in [20] uses autonomous agents and Pi-Calculus to model changes in ontologies.  ... 
doi:10.22266/ijies2017.1231.20 fatcat:4pcyflbs4jcnxgntyf6w7vnz4e

Static Race Detection and Mutex Safety and Liveness for Go Programs (extended version) [article]

Julia Gabet, Nobuko Yoshida
2021 arXiv   pre-print
We represent these properties of programs in a μ-calculus model of types, and validate them using type-level model-checking.  ...  In this paper, we develop a theory based on behavioural types to statically detect data races and deadlocks in Go programs.  ...  , 32] and the example presented above. 6 Verifying Program Properties: the Modal µ-Calculus In this section, we introduce the modal µ-calculus and express various properties over the types.  ... 
arXiv:2004.12859v2 fatcat:rapbqkchfzbovktuladsyeloum

Actor Network Procedures as Psi-calculi for Security Ceremonies

Cristian Prisacariu
2014 Electronic Proceedings in Theoretical Computer Science  
Psi-calculi is a parametric formalism where calculi like spi- or applied-pi are found as instances.  ...  At the same time, this work provides more insight into the details of the ANPs formalization and the graphical representation.  ...  pi-calculus [34, 39] or on the distributed pi-calculus [22, 21] where types capture resources.  ... 
doi:10.4204/eptcs.148.5 fatcat:yqzdcg2t65aytar337tcojfjai

Visual programming language environment for different IoT and robotics platforms in computer science education

Gennaro De Luca, Zhongtao Li, Sami Mian, Yinong Chen
2018 CAAI Transactions on Intelligence Technology  
It is actively used at ASU in several sections of FSE 100: Introduction to Engineering and in CSE 446: Software Integration and Engineering, as well as in several other universities worldwide.  ...  This study presents the authors' recent research and application of a new visual programming language and its development environment: VIPLE (Visual IoT/Robotics Programming Language Environment) at Arizona  ...  Acknowledgments The authors wish to acknowledge those who contributed and helped in conceptualization and development of ASU VIPLE. Particularly, Dr.  ... 
doi:10.1049/trit.2018.0016 fatcat:a34hpsvtpvdmvd5gvacuoy6usi
« Previous Showing results 1 — 15 out of 411 results