682 Hits in 2.9 sec

Page 141 of Journal of Research and Practice in Information Technology Vol. 18, Issue 3 [page]

1986 Journal of Research and Practice in Information Technology  
As was the case with METALOG, this approach makes the language more suited to specialised applica- tions rather than general purpose programming.  ...  CML CML (abbreviation for control meta-language) is a meta-language for controlling the derivation process in Horn clause logic programs (Gallaire and Lasserre, 1979).  ... 

The challenge of many logics: a new approach to evaluating the role of ideology in Quinean commitment

Jody Azzouni
2015 Synthese  
These arguments are challenged by the exhibition of a technical tool-the truncation-model construction of notational equivalents-that compares the ontological role and increased expressive strength of  ...  The focus here is on the influential and important arguments of George Boolos and David Lewis that second-order logic and plural quantification don't incur additional ontological commitments over and above  ...  Acknowledgments My gratitude to the four anonymous referees of this paper for thoughtful and probing criticisms that helped improve this paper a great deal.  ... 
doi:10.1007/s11229-015-0657-9 fatcat:2xwaqg7kxngghjtruu6itqfytu

Page 7114 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
(NL-VUAM; Amsterdam) A metric approach to control flow semantics. (English summary) Papers on general topology and applications (Gorham, ME, 1995), 11-27, Ann. New York Acad.  ...  The approach is illustrated by the definition of an operational and a denotational model for an abstract programming language with parallelism.  ... 

The s-semantics approach: Theory and applications

Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli
1994 The Journal of Logic Programming  
We finally consider some applications, mainly in the area of semantics-based program transformation and analysis. a  ...  This paper is a general overview of an approach to the semantics of logic programs whose aim is to find notions of models which really capture the operational semantics, and are, therefore, useful for  ...  APPLICATIONS As already mentioned, the main motivation of the s-semantics approach is to provide a semantics useful for program analysis and transformation.  ... 
doi:10.1016/0743-1066(94)90026-4 fatcat:5d5ypkaogvafhk2lxz43h3c4mq

On the declarative and procedural semantics of definite metalogic programs

C. Higgins
1996 Journal of Logic and Computation  
We define the class of definite metalogic programs, based on a definite clause language, a binary demonstration predicate, and a naming scheme with both primitive and structured names.  ...  We present a declarative and procedural semantics for an amalgamation of object language and metalanguage.  ...  We use the term "metalogic language" for the amalgamated language and "metalogic program" for the programs we can write in metalogic languages.  ... 
doi:10.1093/logcom/6.3.363 fatcat:ljdadznheza37ergsxjxeoyd2y

A sound metalogical semantics for input/output effects [chapter]

Roy L. Crole, Andrew D. Gordon
1995 Lecture Notes in Computer Science  
We make a standard de nition of bisimilarity and prove it is a congruence using Howe's method. Next, we de ne a metalogical type theory M in which we may give a denotational semantics to O.  ...  We use a novel labelled transition system that uniformly expresses both applicative and imperative computation.  ...  Acknowledgements We thank Simon Gay, Andrew Pitts and Eike Ritter for useful discussions. Roy Crole was supported by a Research Fellowship from the EPSRC. Andrew Gordon was funded by the Types BRA.  ... 
doi:10.1007/bfb0022267 fatcat:uchqn53zfbd2rbe22lbpv4hng4

A natural deduction approach to dynamic logic [chapter]

Furio Honsell, Marino Miculan
1996 Lecture Notes in Computer Science  
We derive in Dynamic Logic a set of rules representing a ND-style system for Hoare Logic.  ...  In this paper we introduce and discuss sound and complete proof systems in Natural Deduction style for representing various "truth" consequence relations of Dynamic Logic.  ...  of programming languages in Type Theories.  ... 
doi:10.1007/3-540-61780-9_69 fatcat:a2blermwyjda7e67aeeme3jlca

Page 3210 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
The approaches in Chapter 4, based solely on the no- tion of a state, are not adequate for the treatment of aspects of fairness and parallelism of programs.  ...  We use a novel labelled transition system that uniformly expresses both applicative and imperative computation.  ... 

An approach to tableau inferencing with "hardwired" heuristics

Hal Berghel, Richard Rankin, Farrukh Burney
1990 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems - SIGSMALL '90  
The heuristics are a subset of those outlined for HARP by Oppacher &d Suen [4] . The prototype was written in C and intended for use with the IBM family of microcomputers.  ...  We shall outline some of our implementation strategies and, insofar as is possible, contrast than with those of the earlier pioneering work of Oppacher and Suen.  ...  As a result of the convenience of the procedure and the desirable metalogical properties, the truth tree variant of the semantic tableau has bccane a & facto standard for first order problem solving [  ... 
doi:10.1145/99412.99436 dblp:conf/sigsmall/BerghelRB90 fatcat:kbn3kngpw5bvdlhtktmxcto3ya

Constructive Type Theory and the Dialogical Approach to Meaning

Shahid Rahman, Nicolas Clerbout
2013 The Baltic International Yearbook of Cognition, Logic and Communication  
Its goal was to provide a new start to a general theory of language and of science.  ...  According to the Erlangen-School, language is not just a fact that we discover, but a human cultural accomplishment whose construction reason can and should control.  ...  , artificial intelligence and the formal Constructive Type Theory 4 semantics of programming languages.  ... 
doi:10.4148/1944-3676.1077 fatcat:3f45t2hjfvcytbpp5ldlbp3f4a

A Syntactic Approach to Foundational Proof-Carrying Code

Nadeem A. Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni
2003 Journal of automated reasoning  
Type systems are a common programming language feature today, allowing fast and easy verification of basic safety properties for application developers.  ...  It presents an approach by which well-typed, high-level programs are compiled to certified machine code.  ...  In the metalogical approach, the operational semantics of the architecture and encodings of object languages are specified in one logic, while safety proofs are supplied as metatheorems in the metalogic  ... 
doi:10.1023/b:jars.0000021012.97318.e9 fatcat:j4hktdoafbb6njacssl3atbtq4

Page 3636 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
Besides LF, there are also other approaches that tackle the representation of logics in a metalogic.  ...  The experiments are done on two ab- stract domains and a significant set of benchmark programs. They seem to demonstrate the practical value of the approach.”  ... 

Knowledge and Its Game-Theoretical Foundations: The Challenges of the Dialogical Approach to Constructive Type Theory [chapter]

Shahid Rahman, Radmila Jovanovic, Nicolas Clerbout
2016 Logic, Epistemology, and the Unity of Science  
These new impulses experienced, by 1980 a parallel renewal in the fields of theoretical computer science, computational linguistics, artificial intelligence and the formal semantics of programming languages  ...  GTS is an approach to formal semantics that, like in the dialogical framework, grounds the concepts of truth or validity on game-theoretical concepts, such as the existence of a winning strategy for a  ...  of a fully-interpreted language -a language with content that challenges the usual metalogical approach to meaning of standard modal theoretic semantics. 14 In the CTT-framework the distinction between  ... 
doi:10.1007/978-3-319-26506-3_3 fatcat:n4hzyjdplnhrpdiyc3rvvrh2mm

Program Development Schemata as Derived Rules

Penny Anderson, David Basin
2000 Journal of symbolic computation  
We show how the formalization and application of schemata for program development can be reduced to the formalization and application of derived rules of inference.  ...  Practically, our formalization yields a simple methodology for carrying out development using existing logical frameworks; we illustrate this in the domain of logic program synthesis and transformation  ...  Our examples are three schemata for logic program development, and they demonstrate the exibility of our approach in developing related schemata for di erent programming language semantics.  ... 
doi:10.1006/jsco.1999.0346 fatcat:5ib6yzqnenf7dc6a2iijqmdwje

Communicating Sequential Processes. By C.A.R. Hoare. Prentice-Hall International, London, 1985, viii+256 pages

1987 Science of Computer Programming  
and finally metalogical programming.  ...  It has a more rigid syntax but gives more flexibility and power in metalogical programming.  ... 
doi:10.1016/0167-6423(87)90028-1 fatcat:upoiu3o3fraojkw2rkg3gftzne
« Previous Showing results 1 — 15 out of 682 results