Filters








36,211 Hits in 2.5 sec

A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL [chapter]

Simon J. Gay
2001 Lecture Notes in Computer Science  
We present a formalisation, in the theorem proving system Isabelle/HOL, of a linear type system for the pi calculus, including a proof of runtime safety of typed processes.  ...  The use of a uniform encoding of pi calculus syntax in a meta language, the development of a general theory of type environments, and the structured formalisation of the main proofs, facilitate the adaptation  ...  As part of a research project investigating type systems for the control of concurrent communication, we are interested in concurrent programming languages based on the pi calculus.  ... 
doi:10.1007/3-540-44755-5_16 fatcat:i6h4la3xyjemvfajisizdkknlm

Resolution methods in proving the program correctness

Branko Markoski, Petar Hotomski, Dusan Malbaski, Danilo Obradovic
2007 Yugoslav Journal of Operations Research  
Proving of program correctness is reduced to finding a proof for assertion that given sequence of formulas represents derivation within a formal theory of special predicted calculus.  ...  A well-known variant of this conception is described: correctness based on programming logic rules. It is shown that programming logic rules may be used in automatic resolution procedure.  ...  derived within calculus k from set R(τ) ∪A(τ) (k is a first-order predicate calculus).  ... 
doi:10.2298/yjor0702275m fatcat:gpupj6smfzdhbejrqndhnret4m

Explainable AI for Workflow Verification in VIPLE

Gennaro De Luca, Yinong Chen
2020 Journal of Artificial Intelligence and Technology  
Teaching students the concepts behind computational thinking is a difficult task, often gated by the inherent difficulty of programming languages.  ...  In this paper, we develop such a system for our own language by employing Pi-Calculus and Hoare Logic. Our detailed system can also perform self-learning of rules.  ...  ACKNOWLEDGMENT The research is partly supported by general funding at IoT and Robotics Education Lab and FURI program at Arizona State University.  ... 
doi:10.37965/jait.2020.0023 fatcat:zi7r57sjnffelop4wsfoe54i5e

Generality in artificial intelligence

John McCarthy
1987 Communications of the ACM  
The first gross symptom is that a small addition to the idea of a program  ...  It was obvious in 1971 and even in 1958 that AI programs suffered from a lack of generality. It is still obvious, and now there are many more details.  ...  A small conceptual modification to a behavior is usually not represented by a small modification to the program, especially if machine language programs are used and any one small modification to the text  ... 
doi:10.1145/33447.33448 fatcat:ghhwnuqcqzci7nrzw3ntkxeb6u

Generality in artificial intelligence

2014 Resonance  
The first gross symptom is that a small addition to the idea of a program  ...  It was obvious in 1971 and even in 1958 that AI programs suffered from a lack of generality. It is still obvious, and now there are many more details.  ...  A small conceptual modification to a behavior is usually not represented by a small modification to the program, especially if machine language programs are used and any one small modification to the text  ... 
doi:10.1007/s12045-014-0032-z fatcat:mb7zfeibajggfcmndmqy5pqksm

Generalised multisets for chemical programming

J.-P. BANÂTRE, P. FRADET, Y. RADENAC
2006 Mathematical Structures in Computer Science  
This extension is formalized by the γ-calculus, a chemical model that summarizes in a few rules the essence of higherorder chemical programming.  ...  By extending the γ-calculus with constants, operators, types and expressive patterns, we build a higher-order chemical programming language called HOCL.  ...  Section 3 presents the γ-calculus, a small higher-order calculus that summarizes the fundamental concepts of chemical programming.  ... 
doi:10.1017/s0960129506005317 fatcat:7u7z7276p5bqlbbiv3spirkjsm

Graph rewrites, from graphic lambda calculus, to chemlambda, to directed interaction combinators [article]

Marius Buliga
2020 arXiv   pre-print
Here I report about the modifications of and relations between graphic lambda calculus, various formalisms which appeared under the name chemlambda and a version of directed interaction combinators.  ...  This is part of the study and experiments with the artificial chemistry chemlambda and the relations with lambda calculus or interaction combinators, as described in arXiv:2003.14332 and available from  ...  Chemlambda v1 (chemical concrete machine) Introduced in [9] arXiv:1309.6914, chemlambda v1 or the chemical concrete machine is a modification of GLC which contains only local rewrites.  ... 
arXiv:2007.10288v1 fatcat:3tcqqan56ng7jery4mrfrlnnti

Graph rewrites, from graphic lambda calculus, to chemlambda, to directed interaction combinatorsm

Marius Buliga
2020 Figshare  
Here I report about the modifications of and relations between graphic lambda calculus, various formalisms which appeared under the name chemlambda and a version of directed interaction combinators.This  ...  is part of the study and experiments with the artificial chemistry chemlambda and the relations with lambda calculus or interaction combinators, as described in arXiv:2003.14332 and available from chemlambda.github.io  ...  Chemlambda v1 (chemical concrete machine) Introduced in [9] arXiv:1309.6914, chemlambda v1 or the chemical concrete machine is a modification of GLC which contains only local rewrites.  ... 
doi:10.6084/m9.figshare.12646208.v1 fatcat:tlueojnpprdxzhb4ixtrbdc5im

Page 7826 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
To compare the two calculi, we need to make a number of small modifications to both.  ...  We begin by modeling classical STRIPS-like totally ordered plans by means of Datalog)s programs, and show that these programs have a sta- ble model semantics that is also amenable to efficient computation  ... 

Page 7891 of Mathematical Reviews Vol. , Issue 99k [page]

1999 Mathematical Reviews  
Moreover, we present an alternative characterization of our new testing semantics by defining a modification of acceptance sets.”  ...  of modal mu-calculus, a powerful logic of programs that sub- sumes dynamic logics such as PDL and APDL, and branching temporal logics such as CTL and CTL*.  ... 

Page 4295 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
The author makes some suggestions for modifications to his calculus that would allow the removal of “almost” from this quotation.  ...  This calculus is basically a restriction of ITT to second order, but it incorporates various well-motivated modifications—e.g., universal quantification over predicates, and distinguishing types from for  ... 

Page 13 of IBM Journal of Research and Development Vol. 4, Issue 1 [page]

1960 IBM Journal of Research and Development  
Finally, IBM JOURNAL* JANUARY 1960 use Steps 4 and 5 of the preceding section. A sample of the print-outs by Program III without the modifications is given in Appendix IV.  ...  The resulting augmented list of theorems in Principia (*9 to *13) from the predicate calculus with equality, has a total number of 158 mem- bers.  ... 

Principles of Chemical Programming

Jean-Pierre Banâtre, Pascal Fradet, Yann Radenac
2005 Electronical Notes in Theoretical Computer Science  
This extension is formalized by the γ-calculus, a chemical model that summarizes in a few rules the essence of higherorder chemical programming.  ...  By extending the γ-calculus with constants, operators, types and expressive patterns, we build a higher-order chemical programming language called HOCL.  ...  Section 3 presents the γ-calculus, a small higher-order calculus that summarizes the fundamental concepts of chemical programming.  ... 
doi:10.1016/j.entcs.2004.07.019 fatcat:yrlgym5fzrhj7d74qt2r63umui

Page 106 of Journal of the Association for Computing Machinery Vol. 5, Issue 1 [page]

1958 Journal of the Association for Computing Machinery  
Computational experience with a program based on a modification of Greenstadt’s method, where special precau- tions are taken to control rounding errors, is described.  ...  One program makes use of the Wielandt method [see description in Bodewig, Matrix Calculus, pp. 293-294] both for acceleration and, if necessary, to replace the power iteration in case the power iteration  ... 

OPUS: a Calculus for Modelling Object-Oriented Concepts [chapter]

Tom Mens, Kim Mens, Patrick Steyaert
1995 OOIS'94  
We propose a very concise calculus for modelling object-oriented concepts such as objects, message sending, encapsulation and incremental modification.  ...  State and encapsulated inheritance are modelled by means of an incremental modification operator.  ...  This calculus can then be used as a theoretical foundation of object-oriented languages, just as is the case for lambda-calculus in the functional programming paradigm.  ... 
doi:10.1007/978-1-4471-3016-1_12 dblp:conf/oois/MensMS94 fatcat:avfeqybz45dn5f46tdkauzvucq
« Previous Showing results 1 — 15 out of 36,211 results