Filters








426 Hits in 4.6 sec

Programming in the meta-language: A tutorial [chapter]

Dines Bjørner
1978 Lecture Notes in Computer Science  
A formal treatment of the semantics, as well as a BNF-like concrete syntax, of a large subset of the meta-language is given in [Jones 78a] following this paper. colloquially known as: META-IV  ...  This paper provides an informal introduction to the "art" of abstractly specifying software architectures using the VDM meta-language ~.  ...  This tutorial teaches you the meta-language. The primary aim is to render you fluent in the notation and its meaning, both as a reader and as a writer.  ... 
doi:10.1007/3-540-08766-4_9 fatcat:xps5gupwgvf4vgk5yrjyjqpx7m

The meta-language: A reference manual [chapter]

Cliff B. Jones
1978 Lecture Notes in Computer Science  
The meta-language described here has been used in the definitions of large programming languages and systems.  ...  This paper is not a tutorial; rather it pro = vides a reference document for the meta-language.  ...  actual meta-language des cribed in this paper was developed at that Laboratory during the period 1973/75.  ... 
doi:10.1007/3-540-08766-4_10 fatcat:vuduvwkbizdtje3i33gt6kq5ge

A Type Specialisation Tutorial [chapter]

John Hughes
1999 Lecture Notes in Computer Science  
However, we can write an interpreter for a polymorphic language in the type specialiser's meta-language.  ...  Specialising this interpreter to a -expression both`compiles' it into the meta-language, and infers its type.  ...  That is, the representation of a function value in residual programs will be a tag identifying the particular function, and a tuple of its free variables exactly the conventional representation of closures  ... 
doi:10.1007/3-540-47018-2_12 fatcat:arqvjprt6jhwtbdc3bcnqnftge

Effects Without Monads: Non-determinism – Back to the Meta Language

Oleg Kiselyov
2019 Electronic Proceedings in Theoretical Computer Science  
The richness of the Meta Language does, in reality, compensate for the simplicity of the effectful DSL.  ...  The key idea goes back to the origins of ML as the Meta Language for the Edinburgh LCF theorem prover. Instead of using ML to build theorems, we now build (DSL) programs.  ...  I thank Robert Harper for pointing out the lax modality and its discussion. This work was partially supported by JSPS KAKENHI Grant Number 17K00091.  ... 
doi:10.4204/eptcs.294.2 fatcat:vo6ezo76anefbm6gfu4ohr63gy

Tutorial Introduction to Graph Transformation: A Software Engineering Perspective [chapter]

Luciano Baresi, Reiko Heckel
2004 Lecture Notes in Computer Science  
In this tutorial we first introduce a simple core model (a set-theoretic presentation of the double-pushout approach [6]) whose features are common to most  ...  In this tutorial, we will introduce the basic concepts and approaches to graph transformation, demonstrate their application to software engineering problems, and provide a high-level survey of graph transformation  ...  of individual applications, and its use as a meta language to specify the syntax, semantics, and manipulation of visual modeling languages, like the UML.  ... 
doi:10.1007/978-3-540-30203-2_30 fatcat:tvvcxxomira2zkfviw4vtqkcwa

Tutorial Introduction to Graph Transformation: A Software Engineering Perspective [chapter]

Luciano Baresi, Reiko Heckel
2002 Lecture Notes in Computer Science  
In this tutorial we first introduce a simple core model (a set-theoretic presentation of the double-pushout approach [6]) whose features are common to most  ...  In this tutorial, we will introduce the basic concepts and approaches to graph transformation, demonstrate their application to software engineering problems, and provide a high-level survey of graph transformation  ...  of individual applications, and its use as a meta language to specify the syntax, semantics, and manipulation of visual modeling languages, like the UML.  ... 
doi:10.1007/3-540-45832-8_30 fatcat:lwb4acas7bhotfkrbvo3ann6ca

Parallel Programming with OCaml: A Tutorial

Victor Allombert, Mathias Bourgoin, Frederic Loulergue
2018 2018 International Conference on High Performance Computing & Simulation (HPCS)  
In this tutorial we present three frameworks for using OCaml to program scalable parallel architectures: BSML, Multi-ML and Spoc.  ...  These features make OCaml a very productive language for developing efficient and safe programs.  ...  OCaml [3] is a functional programming language [4] from the ML (Meta Language) family. It is the main implementation of Caml, a general-purposes language developed at Inria.  ... 
doi:10.1109/hpcs.2018.00016 dblp:conf/ieeehpcs/AllombertBL18 fatcat:lmn7tpgppjeyfietdo4qdxbmsa

Model Checking: A Tutorial Overview [chapter]

Stephan Merz
2001 Lecture Notes in Computer Science  
The paper ends with a list of references to some more advanced topics.  ...  We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder public key protocol.  ...  A Promela Model We represent the protocol in Promela ("protocol meta language"), the input language for the Spin model checker. 2 In order to make the analysis feasible, we make a number of simplifying  ... 
doi:10.1007/3-540-45510-8_1 fatcat:aiidawo4hrfp7lffxax5vxol2i

SPIN Tutorial: How to Become a SPIN Doctor [chapter]

Theo C. Ruys
2002 Lecture Notes in Computer Science  
Spin uses a high level language called Promela (PROcess MEta LAnguage) to specify systems descriptions.  ...  The second part of the tutorial (Advanced Spin) discusses guidelines to construct efficient Promela models and shows how to use Spin in the most effective way.  ...  Gerard Holzmann, the Spin master, is thanked for his approval to reprint the Reducing Complexity guidelines of Xspin in this paper.  ... 
doi:10.1007/3-540-46017-9_3 fatcat:hvd2qhpalje6xphd5hfimbdbsa

Web Accessibility: A Tutorial for University Faculty

David A. Bradbard, Cara Peters
2008 Communications of the Association for Information Systems  
The purpose of this article is to introduce Web accessibility issues to university faculty. The tutorial contains two main sections.  ...  In the first, we review the literature on the magnitude of the problem, empirical studies, and the legal mandates surrounding Web accessibility.  ...  One language created by SGML is XML (extensible markup language) which is a simplified meta-language based on SGML. XML was used to create XHTML (i.e., XHTML is an application of XML).  ... 
doi:10.17705/1cais.02208 fatcat:43yr654xwvauzb3npjyn2fm4ai

Software abstraction principles: Tutorial examples of an operating system command language specification and a PL/I-like on-condition language definition [chapter]

Dines Bjørner
1978 Lecture Notes in Computer Science  
Tools, techniques and examples are presented for, respectively of, each of the eight principles.  ...  , albeit on a very abstract, and in most cases not mechanizable, level, then which are the programming disciplines around which the meta-language evolved, and whose application exploits its capabilities  ...  Hence itwas decided, as a concession to readability, as well as to engineering, to permit variables in the meta-language.  ... 
doi:10.1007/3-540-08766-4_13 fatcat:3m3my6ddorb6nktltaywkramme

Automatically Deriving Schematic Theorems for Dynamic Contexts

Olivier Savary Bélanger, Kaustuv Chaudhuri
2014 Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice - LFMTP '14  
are added to the context in a single backchaining step.  ...  Reflecting on this regular structure can let us derive a number of structural properties about the elements of the context.  ...  This work was partially supported by the INRIA Associated Team grant RAPT and by the ERC Advanced Grant ProofCert.  ... 
doi:10.1145/2631172.2631181 dblp:conf/lfmtp/BelangerC14 fatcat:cuczzb4yyzd5jbqwwmtlu3ycre

KWIC (key word in context)

1984 The Journal of Logic Programming  
[336] on of an Abstract PROLOG Machine [334]An Abstraction in Logic Programming [198]Modularization and Abstraction in Logic Programming [199]Modularization and Abstraction in PROLOG/KR [439]Data Acceptability  ...  Model to Efficient Compilation of Patterns [166]From Abstract PROLOG Instruction Set [672]An Abstract PROLOG Machine-a Specification [383] Abstract PROLOG Machine and its Application to Partial Evaluation  ...  in Logic Circuits [174]_pplication of Meta-language Programming to Feature 14361PROLOG K/R Lanauaae Features'(a Brief Survey) i437]PRhLGG/KR: the Lam guage Features of LISP Machine PROLOG [297]Unique  ... 
doi:10.1016/0743-1066(84)90025-6 fatcat:ypq2jrr3mvd3hflnp6ftrcd5vm

Verifying the unification algorithm in LCF

Lawrence C. Paulson
1985 Science of Computer Programming  
A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating the theory into LCF's domain-theoretic logic is largely straightforward.  ...  The verification is presented as a series of lemmas. The LCF proofs are compared with the original ones, and with other approaches.  ...  Cousineau invested considerable ettort in the implementation of Cambridge LCF. I had valuable conversations with R. Burstall, R. Milner, and R. Waldinger. W.F. Clocksin and I.S.  ... 
doi:10.1016/0167-6423(85)90009-7 fatcat:4d7iq4udt5bq5hspavwfr6yiju

Meta-programming in CLP(R)

Nevin Heintze, Spiro Michaylov, Peter J. Stuckey, Roland H.C. Yap
1997 The Journal of Logic Programming  
Importantly, CLP(,9~ +de') is not just a meta-language for CLP(A'), but it can also be used as its own meta-language.  ...  Unfortunately, this property is not carried over to richer languages such as CLP(A')--the manipulation of CLP(~) programs in CLP(~') is quite limited.  ...  The authors wish to thank Joxan Jaffar, Peter Lee, Michael Maher, Frank Pfenning, and Leon Sterling for important discussions and comments, and the anonymous referees for their comments.  ... 
doi:10.1016/s0743-1066(96)00145-8 fatcat:m4xldmp4azaw3cut7jobxcbjvu
« Previous Showing results 1 — 15 out of 426 results