Filters








1,622 Hits in 2.3 sec

Ensuring termination by typability

Yuxin Deng, Davide Sangiorgi
2006 Information and Computation  
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes.  ...  The systems are obtained by successive refinements of the types of the simply typed π-calculus.  ...  In other words, the termination of P is ensured by the relation among the subjects and objects of the prefixes -rather the subjects alone as it was in the previous system. P ≡ā 10 |!  ... 
doi:10.1016/j.ic.2006.03.002 fatcat:3a2y2vtjfzc3dood77gmzkjjvu

Ensuring Termination by Typability [chapter]

Yuxin Deng, Davide Sangiorgi
IFIP International Federation for Information Processing  
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes.  ...  The systems are obtained by successive refinements of the types of the simply typed π-calculus.  ...  In other words, the termination of P is ensured by the relation among the subjects and objects of the prefixes -rather the subjects alone as it was in the previous system. P ≡ā 10 |!  ... 
doi:10.1007/1-4020-8141-3_47 dblp:conf/ifipTCS/DengS04 fatcat:udmnjjdxgvfdrnrsianpmyelb4

On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms [article]

Olivier Bodini, Paul Tarau
2017 arXiv   pre-print
Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices.  ...  Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices.  ...  Acknowledgement This research has been supported by NSF grant 1423324. We thank to Maciej Bendkowski for salient comments on an earlier draft of this paper and the participants of  ... 
arXiv:1709.04302v1 fatcat:kdufovhnwnfcff4n2jwg5tugki

Security completeness

Andreas Gampe, Jeffery von Ronne
2013 Proceedings of the Eighth ACM SIGPLAN workshop on Programming languages and analysis for security - PLAS '13  
Ensuring that software protects its users' privacy has become an increasingly pressing challenge. Requiring software to be certified with a secure type system is one enforcement mechanism.  ...  This work was supported by the National Science Foundation under grants CCF-0846010 and CNS-0964710.  ...  To ensure termination of our recomputation, we require all treated values to be finite.  ... 
doi:10.1145/2465106.2465122 dblp:conf/pldi/GampeR13 fatcat:nsnuz25kjram3cuxfx3b4e4q7q

Typability and Type Inference in Atomic Polymorphism [article]

M. Clarence Protin, Gilda Ferreira
2022 arXiv   pre-print
In this paper we analyze typability and type inference in Curry style variants of system Fat and show that typability is decidable and that there is an algorithm for type inference which is capable of  ...  It is well-known that typability, type inhabitation and type inference are undecidable in the Girard-Reynolds polymorphic system F.  ...  If there are a type environment Γ and a type A in The proof is done by induction on the structure of M . Let M be a variable x.  ... 
arXiv:2104.13675v5 fatcat:cgi4ni4nsfhbjeibgxfwhkrsne

Type Safety of Rewrite Rules in Dependent Types

Frédéric Blanqui, Zena M. Ariola
2020 International Conference on Formal Structures for Computation and Deduction  
The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules.  ...  In Section 4, we describe a new algorithm for checking that a rewriting rule preserves typing and provide general conditions for ensuring its termination.  ...  By using Knuth-Bendix completion [15, 18] , the equations holding when a LHS is typable are turned into a convergent (i.e. confluent and terminating) set of rewriting rules, so that the type-checking  ... 
doi:10.4230/lipics.fscd.2020.13 dblp:conf/fscd/Blanqui20 fatcat:sxtixva2lfembckrozvruqu3fu

Probabilistic Termination by Monadic Affine Sized Typing [chapter]

Ugo Dal Lago, Charles Grellois
2017 Lecture Notes in Computer Science  
The way typable programs are proved to be almost surely terminating is based on reducibility, but requires a substantial adaptation of the technique.  ...  The proposed type system is powerful enough to type classic examples of probabilistically terminating programs such as random walks.  ...  Termination is ensured by checking during typing that a given metrics decreases during recursive calls.  ... 
doi:10.1007/978-3-662-54434-1_15 fatcat:z4gjpholmnedvgehfdu4m4542u

Termination in Higher-Order Concurrent Calculi [chapter]

Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi
2010 Lecture Notes in Computer Science  
We propose a type system for termination that borrows ideas from termination in Rewriting Systems (and following the approach to termination in the π-calculus in [3]).  ...  Finally, we address termination in a richer calculus that includes localities and a passivation construct, as well as name-passing communication.  ...  By Proposition 2.9, going via the encoding in π therefore provides a procedure to ensure termination of HOpi 2 processes.  ... 
doi:10.1007/978-3-642-11623-0_4 fatcat:a62agyyvi5crlcj3zqqg4bifw4

All the λ-Terms are Meaningful for the Infinitary Relational Model [article]

Pierre Vial
2018 arXiv   pre-print
From the technical point of view, we must deal with the total lack of productivity guarantee for typable terms: we do so by importing methods inspired by first order model theory.  ...  For instance, they allow to type Ω, the auto- autoapplication and they thus do not ensure any form of normalization/productivity.  ...  But, as noted above, in the coinductive case, no form of normalizability is ensured by typability.  ... 
arXiv:1612.06740v2 fatcat:xg32k4mqcfbnxasezbt4uk7asa

Every λ-Term is Meaningful for the Infinitary Relational Model

Pierre Vial
2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18  
This is precisely what we need to understand typability in the relevant and non-idempotent framework (remember § 1.5) in that, we have to ensure that emptiness does not compromise typability: intuitively  ...  By Goal 4, we want to prove that every term t is · -typable.  ... 
doi:10.1145/3209108.3209133 dblp:conf/lics/Vial18 fatcat:bmv3f3dxybarrjv6wd6vp5p5cu

Multi-run Security [chapter]

Arnar Birgisson, Andrei Sabelfeld
2011 Lecture Notes in Computer Science  
The latter suffers from insecurity: secrets can be leaked in their entirety by multiple runs of programs that are secure according to batch-job termination-insensitive noninterference.  ...  The policy framework is based on tracking the attacker's knowledge about secrets obtained by multiple program runs.  ...  This work was funded by the European Community under the WebSand project and the Swedish research agencies SSF and VR.  ... 
doi:10.1007/978-3-642-23822-2_21 fatcat:b56ogjsoozcfvk53yby4zvhk44

Termination in higher-order concurrent calculi

Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi
2010 The Journal of Logic and Algebraic Programming  
We propose a type system for termination that borrows ideas from termination in Rewriting Systems (and following the approach to termination in the π-calculus in [3]).  ...  Finally, we address termination in a richer calculus that includes localities and a passivation construct, as well as name-passing communication.  ...  By Proposition 2.9, going via the encoding in π therefore provides a procedure to ensure termination of HOpi 2 processes.  ... 
doi:10.1016/j.jlap.2010.07.007 fatcat:oepgqs2mmbbp3de5a3cqpady3q

Causal Computational Complexity of Distributed Processes

Romain Demangeon, Nobuko Yoshida
2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18  
Next we apply a syntactic flow analysis to typable processes to ensure the computational bound of distributed messages.  ...  a polynomial of the content of this request; and complete which means that each polynomial recursive function can be computed by a typable process.  ...  Process H is typable by our typing system. Limitation of the Typing System.  ... 
doi:10.1145/3209108.3209122 dblp:conf/lics/DemangeonY18 fatcat:lu7kt5gj6zatxgzweu36mjh3q4

An Intersection Type System for Deterministic Pushdown Automata [chapter]

Takeshi Tsukada, Naoki Kobayashi
2012 Lecture Notes in Computer Science  
Although the refinement procedure may not terminate in general, we give a sufficient condition for the termination.  ...  This work is partially supported by Kakenhi 23220001 and 22·3842.  ...  N is a finite set of symbols called non-terminals. They have the sort o → o. Non-terminals are ranged over by F . 2. Σ is a finite set of symbols called terminals.  ... 
doi:10.1007/978-3-642-33475-7_25 fatcat:csgksyfowjhwbdobctz5rthmqa

Noninterference for concurrent programs and thread systems

Gérard Boudol, Ilaria Castellani
2002 Theoretical Computer Science  
Our proposal is in the line of some recent work by Irvine, Volpano and Smith.  ...  We propose a type system to ensure the property of noninterference in a system of concurrent programs, described in a standard imperative language enriched with parallelism.  ...  Indeed, checking the termination of a program with high guards may be dangerous, as shown by the system-with a mistaken, still typable scheduler: P[when s 1 do (U ; t 1 := tt) when s 2 do (y L := 0 ; y  ... 
doi:10.1016/s0304-3975(02)00010-5 fatcat:fqdzcnga55cq5l4o6hvby2xdma
« Previous Showing results 1 — 15 out of 1,622 results