Dissertations / Theses: 'Computer programming language'

1

Grattage, Jonathan James. "A functional quantum programming language." Thesis, University of Nottingham, 2006. http://eprints.nottingham.ac.uk/10250/.

Full text

Abstract:

This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms into superoperators, via the operational semantics, made precise by the category Q. Extensional equality for QML programs is also presented, via a mapping from FQC morphisms into the category Q.

APA, Harvard, Vancouver, ISO, and other styles

2

Cardone, Richard Joseph. "Language and compiler support for mixin programming." Access restricted to users with UT Austin EID Full text (PDF) from UMI/Dissertation Abstracts International, 2002. http://wwwlib.umi.com/cr/utexas/fullcit?p3077428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Öigaard, Sandra. "Programming language & Gender." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-45707.

Full text

Abstract:

Once women were the pioneers within the tech industry, but during the last decades the amount of women who choose a career within computer science has decreased rapidly. Programming languages have evolved during the last decades and because of the growing gender gap in the industry, they have done so involuntarily in the absence of women. The imbalance raises the question if the tech industry and the programming languages have been adapted for a more masculine way of developing software. A quantitative study and a literature review evaluates if there is a need for a computerlanguage developed towards women. The study comes to the conclusion that there is no need for a female inspired computer language, but the way computer languages are taught suits the male way of thinking better than the female way.

APA, Harvard, Vancouver, ISO, and other styles

4

Perez, Manuel A. "A language for interactive computer graphics programming." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/484784.

Full text

Abstract:

The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented programming language. Most of these data types are not available in today's languages. They are usually defined as structures or records composed of some other basic types. These include points, rectangles, transformations, etc. Some operators, such as vector addition, are defined to work with them.The design and implementation of an interpreter to test some of these graphics data types and operators are discussed.The writer also examines some of the tools needed in a graphics programming environment.

APA, Harvard, Vancouver, ISO, and other styles

5

Pellerin, Clément. "Taskell : a concurrent constraint programming language." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61089.

Full text

Abstract:

Taskell is an instance of the concurrent constraint programming framework cc. The framework is parameterized by a choice of constraint system. The constraint system of Taskell is the set of finite trees with equality. The choice of constraint system makes Taskell similar to concurrent logic programming languages. When computing with partial information the notion of reading and writing memory becomes incoherent. The framework replaces these operations by ask and tell respectively. We hope to understand this new paradigm by studying implementations of cc languages. Taskell is a parallel implementation of a cc language written in Concurrent ML.

APA, Harvard, Vancouver, ISO, and other styles

6

Kilaru, Jyothsna. "PLASA| Programming Language for Synchronous Agents." Thesis, California State University, Long Beach, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10978428.

Full text

Abstract:

The introduction of autonomous agents to replace humans in unfavorable and unreachable environments has been a longstanding goal in the field of robotics. The existing work of various researchers address several challenges involved in design or control of such robotic systems. However, existing solutions have been unable to offer users an easy and efficient programming environment for developing versatile robotic applications. These inadequacies have given rise to the development of a new robot programming language, called Programming LAnguage for Synchronous Agents (PLASA).

The main objective of this paper is to give a brief introduction about the newly developed robot programming language, PLASA, which facilitates the rapid implementation of co-operative applications on multiple physical robots, in dynamic environments. The syntax and semantics of this language are similar to those in many other high-level programming languages. In addition to the features offered by other high-level languages, PLASA offers two novel instructions: "do instruction'', which helps in executing the main motion primitives, and "query instruction'', which helps in executing a great variety of geometric and mathematical queries. A compiler produces a program that is executed by a virtual machine in each of the robots. The virtual machine offers a key characteristic that guarantees the timely execution of robots' movements through a synchronization protocol. To verify the correct functionality of the co-operative applications, a simulator that includes the proposed components has been provided.

The developed language offers abstraction for hiding complex network details and delivers human-readable language; these features make the programming environment suitable for anyone to control robot systems, regardless of expertise. The synchronization and co-ordination mechanisms provided by the language ensure the safety and prompt execution of robot operations in a robot system developed using PLASA.

APA, Harvard, Vancouver, ISO, and other styles

7

Rose, Eli. "Arrow: A Modern Reversible Programming Language." Oberlin College Honors Theses / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1443226400.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wendelborn, Andrew Lawrence. "Data flow implementations of a lucid-like programming language." Title page, contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phw471.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Svallfors, Hugo. "Sard: An Object-Functional Programming Language." Thesis, Umeå universitet, Institutionen för datavetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-51276.

Full text

Abstract:

This bachelor's degree concerns the specification of a new programming language. This language, called Sard, is a backwards-incompatible new version of the existing language Scala. Sard, like Scala, is a high-level object-functional language. Unlike Scala, it is not very closely tied to the JVM or Java, eliminating some constraints on the language's design. Since this necessitates breaking backwards compatibility with Scala, the opportunity to disregard it is used to x some of the author's irritations with the language. This degree mostly focuses on deciding on the exact changes to Scala, and on the overall design, rather than on implementing a compiler for the language. A reason for this is that the bachelor's degree provides insuficient time to properly implement´and debug a compiler. Another is the desirability of pushing changes to the language as early into the design process as possible. Preferably, almost all changes to the language should occur before any compiler code has been written. The design eventually produced gets rid of some known issues stemming from the JVM, like null pointers, non-reified generics and single inheritance. Several features of Scala, like self-type annotations and in x syntax for methods are scrapped. Others, like pattern matching, are generalized. Some changes to the syntax are also made, particularly in the areas of closures, pattern matching and object construction. As of yet, this language has no implementation, and in future work, this must be rectified. Sard also requires calling compatibility with another programming language, but this remains to be specified. Nevertheless, Sard constitutes a promising refinement of an already great programming language, and it is hoped that Sard will x the few remaining issues with Scala's design.

APA, Harvard, Vancouver, ISO, and other styles

10

李詠康 and Wing-hong Lee. "D: a distributed object oriented programming language." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B31211616.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Lee, Wing-hong. "D : a distributed object oriented programming language /." [Hong Kong : University of Hong Kong], 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13645341.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Green, Alexander S. "Towards a formally verified functional quantum programming language." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/11457/.

Full text

Abstract:

This thesis looks at the development of a framework for a functional quantum programming language. The framework is first developed in Haskell, looking at how a monadic structure can be used to explicitly deal with the side-effects inherent in the measurement of quantum systems, and goes on to look at how a dependently-typed reimplementation in Agda gives us the basis for a formally verified quantum programming language. The two implementations are not in themselves fully developed quantum programming languages, as they are embedded in their respective parent languages, but are a major step towards the development of a full formally verified, functional quantum programming language. Dubbed the “Quantum IO Monad”, this framework is designed following a structural approach as given by a categorical model of quantum computation.

APA, Harvard, Vancouver, ISO, and other styles

13

Doan, Thu Trang. "Meta-APL : a general language for agent programming." Thesis, University of Nottingham, 2014. http://eprints.nottingham.ac.uk/29286/.

Full text

Abstract:

A key advantage of BDI-based agent programming is that agents can deliberate about which course of action to adopt to achieve a goal or respond to an event. However while state-of-the-art BDI-based agent programming languages provide flexible support for expressing plans, they are typically limited to a single, hard-coded, deliberation strategy(perhaps with some parameterisation) for all task environments. In this thesis, we describe a novel agent programming language, meta-APL, that allows both agent programs and the agent’s deliberation strategy to be encoded in the same programming language. Key steps in the execution cycle of meta-APL are reflected in the state of the agent and can be queried and updated by meta-APL rules, allowing a wide range of BDI deliberation strategies to be programmed. We give the syntax and the operational semantics of meta-APL, focussing on the connections between the agent’s state and its implementation. Finally, to illustrate the flexibility of meta-APL, we show how Jason and 3APL programs and deliberation strategy can be translated into meta-APL to give equivalent behaviour under weak bisimulation equivalence.

APA, Harvard, Vancouver, ISO, and other styles

14

Chan, Chi-hown Johnny. "Implementation of computer simulation software in learning low-level computer language : a case study /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B24700770.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Rizk, A. "MC : A concurrent programming language for distributed computer systems." Thesis, University of Sussex, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373906.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Xie, Jiantao 1979. "Text operators in a relational programming language." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82451.

Full text

Abstract:

JRelix is an implementation of a relational database system which provides a significantly powerful database programming language and which is especially adept with complex data. This thesis documents an enhancement of JRelix which provides intuitive descriptions and efficient manipulations for textual information in the database.
Coupled with the relational and domain algebra in JRelix, the new database system supports rapid textual information retrieval, flexible text mining, structured text schema discovery, relational operations on text, transformation between text and relation, and powerful pattern matching in structured or unstructured data. These endow JRelix with the capacity of handling complicated textual information from heterogeneous data sources (e.g., data from the web), and also enrich its searching power on vast bodies of electronic data as a text/relational database management system.

APA, Harvard, Vancouver, ISO, and other styles

17

Adams, Stephen Robert. "Modular grammars for programming language prototyping." Thesis, University of Southampton, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Shapiro, David. "Compiling Evaluable Functions in the Godel Programming Language." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5101.

Full text

Abstract:

We present an extension of the Godel logic programming language code generator which compiles user-defined functions. These functions may be used as arguments in predicate or goal clauses. They are defined in extended Godel as rewrite rules. A translation scheme is introduced to convert function definitions into predicate clauses for compilation. This translation scheme and the compilation of functional arguments both employ leftmost-innermost narrowing. As function declarations are indistinguishable from constructor declarations, a function detection method is implemented. The ultimate goal of this research is the implementation of extended Godel using needed narrowing. The work presented here is an intermediate step in creating a functional-logic language which expands the expressiveness of logic programming and streamlines its execution.

APA, Harvard, Vancouver, ISO, and other styles

19

Aslam, Toheed. "AspectMatlab: an aspect-oriented scientific programming language." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=92378.

Full text

Abstract:

There has been relatively little work done in the compiler research community for incorporating aspect-oriented features in scientific and dynamic programming languages.
MATLAB is a dynamic scientific programming language that is commonly used by scientists because of its convenient and high-level syntax for arrays, the fact that type declarations are not required, and the availability of a rich set of application libraries. This thesis introduces a new aspect-oriented scientific language, AspectMatlab.
AspectMatlab introduces key aspect-oriented features in a way that is both accessible to scientists and where the aspect-oriented features concentrate on array accesses and loops, the core computation elements in scientific programs. One of the main contributions of this thesis is to provide a compiler implementation of the AspectMatlab language. It is supported by a collection of scientific use cases, which portray the potential of the aspectorientation for scientific problems.
Introducing aspects into a dynamic language such as MATLAB also provides some new challenges. In particular, it is difficult to statically determine precisely where patterns match, resulting in many dynamic checks in the woven code. The AspectMatlab compiler uses flow analyses to eliminate many of those dynamic checks.
This thesis reports on the language design of AspectMatlab, the amc compiler implementation, and also provides an overview of the use cases that are specific to scientific programming. By providing clear extensions to an already popular language, AspectMatlab will make aspect-oriented programming accessible to a new group of programmers including scientists and engineers.
Relativement peu de travail a été accomplis dans le milieu de la recherche du compilateur pour l'intégration des caractéristiques orientées à l'aspect dans les domaines scientifique et dynamique des langages de programmation. Matlab est un langage de programmation scientifique dynamique qui est couramment utilisé par les scientifiques en raison de sa pratique et la syntaxe de qualité pour des tableaux ; du fait que les déclarations de type ne sont pas nécessaires, et de la disponibilité de vastes bibliothèques d'applications. Cette thèse introduit un nouvel aspect de langue de recherche scientifique : AspectMatlab.
AspectMatlab introduit fonctionnalités d'aspect orientées d'une manière qui est à la fois accessible aux scientifiques et où les fonctionnalités d'aspect orientées se concentrent sur les accès réseau et des boucles, les éléments de calcul de base dans les programmes scientifiques. L'une des principales contributions de cette thèse est de fournir une implémentation du compilateur du langage AspectMatlab. Il est soutenu d'une collection de cas d'utilisation scientifique, qui montre le potentiel de l'orientation aspect pour des problèmes scientifiques.
L'introduction des aspects dans un langage dynamique comme Matlab représente aussi quelques nouveaux défis. En particulier, il est difficile de déterminer statiquement où les modèles coïncident, résultant dans de nombreux contrôles dynamiques dans le code tissé. Le compilateur d'AspectMatlab utilise le flux d'analyses pour éliminer un grand nombre de ces contrôles dynamiques.
Cette thèse signale la conception du language d'AspectMatlab et l'implementation du compilateur amc. Elle fournit également un aperçu de l'utilisation des cas qui sont spécifiques à la programmation scientifique. En fournissant des extensions claires avec un langage déjà populaire, AspectMatlab rendra la programmation orientée à l'aspect accessible à un nouveau groupe de programmeurs y compris des scientifiques et des ingénieurs.

APA, Harvard, Vancouver, ISO, and other styles

20

Judd, Mark. "A view of types and parameterization in programming languages /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Ding, Weiren. "Selsyn-C : a self-synchronizing parallel programming language." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22494.

Full text

Abstract:

In thesis thesis we report the design and implementation of a new self-scheduling parallel programming language, SELSYN-C. As parallel processors become more accessible to a broad range of programmers, the development of simple to use and effective programming languages becomes increasingly important. Our approach to the challenge of parallel programming language design and implementation is two-fold: (1) the design of simple extensions to C that are both easy to use for the programmer, and useful for effective compilation, and (2) the design of efficient and effective scheduling strategies that can be automatically supported by a compiler and associated run-time environment.
We outline our approach by presenting: (1) our motivation, (2) an overview of the extensions to C that form the SELSYN-C programming language, and (3) the development of a new scheduling mechanism that can be used to effectively compile SELSYN-C programs for a real parallel processor, the BBN Butterfly GP-1000. Different scheduling strategies for this mechanism were studied via several experimental tests and the results of these experiments are reported.
A source-to-source compiler supporting the SELSYN-C language has been implemented. Included in this thesis is a description of both the compiler and associated run-time environment.

APA, Harvard, Vancouver, ISO, and other styles

22

El-Kays, Ahmad Ziad. "Implementing event handlers in a database programming language." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23884.

Full text

Abstract:

This thesis introduces active database concepts to a relational database system. Event handlers are introduced as user defined procedures. An event is the procedure call by the system, triggered in our case by an update statement.
Event handlers for the Relix (Relational database on UNIX) update statement have been implemented. These event handlers are of two types: the first type is that which runs before an update statement. The second type runs after an update statement. Also, event handlers have states. An event handler can be either active or inactive. Event handlers are executed when they are in the active state.
Event handlers have the property of being "one-to-many", i.e. for a single event more than one event handler can be defined. Another property is non-determinism, i.e., event handlers are executed with no pre-specified order.
In this thesis we present the design and implementation of event handlers in Relix. The mechanism that we introduced in Relix is equivalent to the EA model.

APA, Harvard, Vancouver, ISO, and other styles

23

Sutyanyong, Nattavut. "Procedural abstraction in a relational database programming language." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=55531.

Full text

Abstract:

This thesis introduces the notion of procedural abstraction in a relational database system. Procedures are treated as special forms of relations, and called computations.
Like relations, a computation is defined over a set of attributes. Subset of attributes can be defined as input attributes and the remaining attributes are output. Beyond the notion of procedures that a procedure can have only one set of input and output parameters, computations are symmetric: a computation may have a number of different subsets of input attributes.
Computations can be recursive and called by other computations.
States are introduced so that computations can remember values from previous evaluation and use them in next invocations. Stateful computations may be instantiated to have new sets of states.
This thesis contains the design and implementation of a parser for compiling computations as well as operations to evaluate them. All operations are coincident with relational algebra, a set of operations for manipulating relations.

APA, Harvard, Vancouver, ISO, and other styles

24

Chen, YuLing 1970. "A GIS editor for a database programming language /." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31209.

Full text

Abstract:

Geographical Information Systems (GIS) have become a more and more important application of database systems. Most general-purpose database systems do not contain a graphical display interface which is indispensable in GIS applications. This thesis presents the design and implementation of a GIS editor (Geditor) for a relational database programming language. It builds a graphical map display interface into the database language and integrates a set of GIS functions.
Two interfaces are built in Geditor. One is with the database programmer and the other is with the GIS End-User. The former interface implements a new syntax (gedit) into the database language for the database programmer to call and display the Geditor GUI. The latter implements a GUI with the GIS End-User to view the map and perform a series of fundamental GIS functions.
Geditor stores both spatial and non-spatial data in the relational database. The implementation utilizes the spatial capabilities of the relational database programming language to the largest extent. This demonstrates the feasibility and the simplicity of implementing GIS applications in an integrated approach using relational databases. It also provides a flexible and extendable framework by designing an extendable syntax and utilizing the event handler mechanism which is the characteristic of active databases. Java, especially the JFC Swing package is used extensively in the implementation.

APA, Harvard, Vancouver, ISO, and other styles

25

Lui, Rebecca. "Implementation of procedures in a database programming language." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27373.

Full text

Abstract:

This thesis documents the design and implementation of procedures in a database programming language. The purpose of this thesis is to integrate procedure facilities into an existing relational database system.
A relation is defined over a set of attributes. Given the values of a subset of attributes as input, a selection operation looks up the relation and outputs the values of the remaining attributes. Our proposed procedure construct supports this concept: a procedure is defined over a set of parameters, and the procedure can be invoked with different subsets of input parameters. This is accomplished by allowing procedures to have a sequence of blocks within the procedure body. Each block abstracts a sequence of actions which requires a subset of parameters as input. Users can select different blocks to be activated by supplying different subsets of input parameters. While a relation can be selected with any subset of input attributes, a procedure can only be invoked with defined subsets of parameters.
Our proposed procedures also support the usual properties of procedural abstraction: encapsulation and parameterization. A procedure declaration defines the procedure name, formal parameters, and the body. Procedure invocation is through the use of a stand-alone procedure call statement which specifies the procedure name and a list of actual parameters. Before a procedure is activated, the formal parameters within the procedure body are replaced by the corresponding actual parameters. Moreover, a procedure can be printed, shown, deleted, called by itself or other procedures, and passed as a parameter.

APA, Harvard, Vancouver, ISO, and other styles

26

Chiama, Jared Alungo. "Text operations for a relational database programming language." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22726.

Full text

Abstract:

In this thesis we introduce a method of storing static text data, and algorithms for operations on the data, in a relational database programming language.
We introduce a text data type, and implement relational algebra operations on the text data type. Our method stores the text data in text files external to the relations, and maintains pointers to the text data within the relations. Our algorithms minimize accesses to the actual text data so as to maintain the efficiency of database operations.
We also implement a text processing mechanism where a text script can be joined to a relation, producing an individualized text script for each tuple in the relation. Our implementation includes queries involving pattern searches within text attribute values.
All operations on text data are relational algebra operations, requiring the text data to be in relations, and returning relations as results.

APA, Harvard, Vancouver, ISO, and other styles

27

Andreev, Maxim. "Operations on text in a database programming language." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0017/MQ55034.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Berman, Sonia. "P-Pascal : a data-oriented persistent programming language." Doctoral thesis, University of Cape Town, 1991. http://hdl.handle.net/11427/17084.

Full text

Abstract:

Bibliography: pages 187-199.
Persistence is measured by the length of time an object is retained and is usable in a system. Persistent languages extend general purpose languages by providing the full range of persistence for data of any type. Moreover, data which remains on disk after program termination, is manipulated in the same way as transient data. As these languages are based on general purpose programming languages, they tend to be program-centred rather than data-centred. This thesis investigates the inclusion of data-oriented features in a persistent programming language. P-Pascal, a Persistent Pascal, has been designed and implemented to develop techniques for data clustering, metadata maintenance, security enforcement and bulk data management. It introduces type completeness to Pascal and in particular shows how a type-complete set constructor can be provided. This type is shown to be a practical and versatile mechanism for handling bulk data collections in a persistent environment. Relational algebra operators are provided and the automatic optimisation of set expressions is performed by the compiler and the runtime system. The P-Pascal Abstract Machine incorporates two complementary data placement strategies, automatic updating of type information, and metadata query facilities. The protection of data types, primary (named) objects and their individual components is supported. The challenges and opportunities presented by the persistent store organisation are discussed, and techniques for efficiently exploiting these properties are proposed. We also describe the effects on a data-oriented system of treating persistent and transient data alike, so that they cannot be distinguished statically. We conclude that object clustering, metadata maintenance and security enforcement can and should be incorporated in persistent programming languages. The provision of a built-in, type-complete bulk data constructor and its non-procedural operators is demonstrated. We argue that this approach is preferable to engineering such objects on top of a language, because of greater ease of use and considerable opportunity for automatic optimisation. The existence of such a type does not preclude programmers from constructing their own bulk objects using other types - this is but one advantage of a persistent language over a database system.

APA, Harvard, Vancouver, ISO, and other styles

29

Van, Riet F. A. "LF : a language for reliable embedded systems." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52322.

Full text

Abstract:

Thesis (MSc)--University of Stellenbosch, 2001.
ENGLISH ABSTRACT: Computer-aided verification techniques, such as model checking, are often considered essential to produce highly reliable software systems. Modern model checkers generally require models to be written in eSP-like notations. Unfortunately, such systems are usually implemented using conventional imperative programming languages. Translating the one paradigm into the other is a difficult and error prone process. If one were to program in a process-oriented language from the outset, the chasm between implementation and model could be bridged more readily. This would lead to more accurate models and ultimately more reliable software. This thesis covers the definition of a process-oriented language targeted specifically towards embedded systems and the implementation of a suitable compiler and run-time system. The language, LF, is for the most part an extension of the language Joyce, which was defined by Brinch Hansen. Both LF and Joyce have features which I believe make them easier to use than other esp based languages such as occam. An example of this is a selective communication primitive which allows for both input and output guards which is not supported in occam. The efficiency of the implementation is important. The language was therefore designed to be expressive, but constructs which are expensive to implement were avoided. Security, however, was the overriding consideration in the design of the language and runtime system. The compiler produces native code. Most other esp derived languages are either interpreted or execute as tasks on host operating systems. Arguably this is because most implementations of esp and derivations thereof are for academic purposes only. LF is intended to be an implementation language. The performance of the implementation is evaluated in terms of practical metries such as the time needed to complete communication operations and the average time needed to service an interrupt.
AFRIKAANSE OPSOMMING: Rekenaar ondersteunde verifikasietegnieke soos programmodellering, is onontbeerlik in die ontwikkeling van hoogs betroubare programmatuur. In die algemeen, aanvaar programme wat modelle toets eSP-agtige notasie as toevoer. Die meeste programme word egter in meer konvensionele imperatiewe programmeertale ontwikkel. Die vertaling vanuit die een paradigma na die ander is 'n moelike proses, wat baie ruimte laat vir foute. Indien daar uit die staanspoor in 'n proses gebaseerde taal geprogrammeer word, sou die verwydering tussen model en program makliker oorbrug kon word. Dit lei tot akkurater modelle en uiteindelik tot betroubaarder programmatuur. Die tesis ondersoek die definisie van 'n proses gebaseerde taal, wat gemik is op ingebedde programmatuur. Verder word die implementasie van 'n toepaslike vertaler en looptyd omgewing ook bespreek. Die taal, LF, is grotendeels gebaseer op Joyce, wat deur Brinch Hansen ontwikkel is. Joyce en op sy beurt LF, is verbeterings op ander esp verwante tale soos occam. 'n Voorbeeld hiervan is 'n selektiewe kommunikasieprimitief wat die gebruik van beide toevoer- en afvoerwagte ondersteun. Omdat 'n effektiewe implementasie nagestreef word, is die taalontwerp om so nadruklik moontlik te wees, sonder om strukture in te sluit wat oneffektief is om te implementeer. Sekuriteit was egter die oorheersende oorweging in die ontwerp van die taal en looptyd omgewing. Die vertaler lewer masjienkode, terwyl die meeste ander implementasies van eSP-agtige tale geinterpreteer word of ondersteun word as prosesse op 'n geskikte bedryfstelsel- die meeste eSP-agtige tale word slegs vir akademiese doeleindes aangewend. LF is by uitstek ontwerp as implementasie taal. Die evaluasie van die stelsel se werkverrigting is gedoen aan die hand van praktiese maatstawwe soos die tyd wat benodig word vir kommunikasie, sowel as die gemiddelde tyd benodig vir die hantering van onderbrekings.

APA, Harvard, Vancouver, ISO, and other styles

30

Ahmad, Salman Azeem. "Programming language design for service-oriented systems." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92961.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 179-187).
Designing systems in a service-oriented manner, in which application features are decoupled and run as independently executing services over a network, is becoming more commonplace and popular. Service-oriented programming provides a natural way to model and manage many types of systems and allows software development teams to achieve operational flexibility, scalability, and reliability in a cost-effective manner. In particular, it has been used quite successfully for Web and mobile applications. However, building, deploying, and maintaining service-oriented systems is challenging and requires extensive planning, more effort during development, a detailed understanding of advanced networking techniques, and the use of complicated concurrent programming. This thesis presents a new programming language called Silo. Silo integrates features that address key conceptual and pragmatic needs of service-oriented systems that, holistically, are not easily satisfied by existing languages. Broadly, these needs include: a unified distributed programming model, a simple yet ecient construct for concurrency, a familiar yet extensible syntax, and the ability to interoperate with a rich ecosystem of libraries and tools. In this dissertation, I describe how Silo's features, constructs, and conventions satisfy these needs. Then, I present various compiler and runtime techniques used in Silo's implementation. Lastly, I provide a demonstration, through a variety of programming patterns and applications, of how Silo facilitates the design, implementation, and management of service-oriented systems.
by Salman Azeem Ahmad.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

31

Steele, Matthew D. M. Eng (Matthew David) Massachusetts Institute of Technology. "A programming language for precision--cost tradeoffs." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53149.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 81-82).
Many computational systems need to deal with various forms of imprecision and uncertainty in their data; it is also the case that many systems, especially mobile and distributed systems, must be able to trade off the precision of their data and operations against the cost of performing those operations. Unfortunately, for many applications, trying to make these tradeoffs severely complicates the program, because there does not yet exist a programming model that gives the programmer the ability to easily describe the relevant tradeoffs between precision and cost of operations or to express in an algorithm what tradeoffs are appropriate under what circumstances. This paper lays a solid foundation for exploring such programming models by introducing and analyzing a simple core abstraction on which others can be based. We determine what sorts of strategies are and are not possible within this abstraction, and discuss what specific difficulties must be overcome in future work in order to extend the abstraction to encompass a larger class of programs.
by Matthew D. Steele.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

32

Glen, Andrew Gordon. "A probability programming language: Development and applications." W&M ScholarWorks, 1998. https://scholarworks.wm.edu/etd/1539623920.

Full text

Abstract:

A probability programming language is developed and presented; applications illustrate its use. Algorithms and generalized theorems used in probability are encapsulated into a programming environment with the computer algebra system Maple to provide the applied community with automated probability capabilities. Algorithms of procedures are presented and explained, including detailed presentations on three of the most significant procedures. Applications that encompass a wide range of applied topics including goodness-of-fit testing, probabilistic modeling, central limit theorem augmentation, generation of mathematical resources, and estimation are presented.

APA, Harvard, Vancouver, ISO, and other styles

33

Lopez, Gustavo. "The design and implementation of Kaleidoscope, a constraint imperative programming language /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6928.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Miller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Lindgren, Sebastian. "A Mobile Graph-Like Visual Programming Language." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-36249.

Full text

Abstract:

Visual programming is a programming paradigm commonly used for game scripting, it also has applications in other areas such as for example patcher languages for music and animation and even a few languages for general purpose programming. By using visual programming complex tasks can be made easier by abstracting the code and letting the user express a flow of commands instead. This also gives a better overview of the problem and how the different parts connect. By graphically connecting nodes the program flow will be made clear even for those new to programming. Unfortunately, visual programming is mostly limited to laptops and stationary computer systems. Touch enabled mobile devices which perhaps would be even better suited for a visual programming approach are left with textual programming environments, which doesn’t use the capabilities of the touch screen, and a few non-graph-like visual programming languages, which use interlocked blocks to represent code. To explore how well graph-like visual programming would work on mobile devices a study will be conducted in which a lo-fi design is created and iteratively evaluated and improved using a modified NEVO process. The design will be created and improved based on existing visual programming interfaces and research in the area of visual programming, interaction design and information design, combined with the input from the test subjects. In this work a mobile, visual, graph-like, general purpose programming language has been designed. A lo-fi prototype of the language has been created to display how the language would look on a mobile system if realized. The lo-fi prototype was then tested with a method given by Rettig to give an indication of the systems usability measured by its task completion time compared to the task completion time of a mobile textual system. There is also a qualitative analysis on the responses from the test users. The tests were conducted both on people new to programming as well as people who have been programming for a while.

APA, Harvard, Vancouver, ISO, and other styles

36

McNamara, Brian. "Multiparadigm programming novel devices for implementing functional and logic programming constructs in C++ /." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-07122004-121450/unrestricted/mcnamara%5Fbrian%5Fm%5F200407%5Fphd.pdf.

Full text

Abstract:

Thesis (Ph. D.)--College of Computing, Georgia Institute of Technology, 2005. Directed by Yannis Smaragdakis.
Spencer Rugaber, Committee Member ; Olin Shivers, Committee Member ; Mary Jean Harrold, Committee Member ; Yannis Smaragdakis, Committee Chair ; Philip Wadler, Committee Member. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

37

Germain, Renaud. "Implementation of a dependently typed functional programming language." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:8881/R/?func=dbin-jump-full&object_id=92350.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Petcharawises, Thavisakdi. "Programming language as a tool for software design." DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1985. http://digitalcommons.auctr.edu/dissertations/2471.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Sun, Weizhong 1975. "Updates and events in a nested relational programming language." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33448.

Full text

Abstract:

This thesis documents the design and implementation of Updates and Event Handlers in a relational database programming language. Update operations are implemented in the nested relational model and Event Handlers transform the database system from passive to active.
The update operation allows the user to change values of specified attributes in certain tuples. These attributes can be selected by a "using" clause which uses a relational algebra operation to select tuples from the relation we want to update. We can also use updates to add or delete some tuples to or from the relation. The nested update in nested relations will also be presented.
Event handlers are introduced as procedures, invoked by events which are system generated procedure calls. We implement the event handler based on computation---the procedural abstraction facility of the database programming language.
An update statement can invoke multiple event handlers. Event handlers may contain update statements which in turn invoke other event handlers. This introduces cascading event handlers. We will present the combination of update and event handler algorithm by which the update; operation is coupled with event handler closely and neatly, and the cascading event handler is handled by the system's recursive execution.
In this thesis, we provide the user a uniform syntax to update both flat relations and nested relations. The unification of computation and procedure leads to a simpler language. More over, the explicitness and intuitiveness of the definition and implementation of both event and event handler are under substantial considerations.

APA, Harvard, Vancouver, ISO, and other styles

40

Komioti, Maria. "Implementation of process synthronization in a database programming language." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61164.

Full text

Abstract:

This thesis adds the feature of interprocess communication to a database programming language.
Relix has been designed in order to provide a very powerful database query facility as well as a high level database programming language. The process synchronization feature is very useful for programming languages, and thus our aim is to incorporate such a feature in relix. This is done by introducing a delay mechanism which is modelled on LINDA, a technique for interprocess communication. In order to minimize the new syntax, we base our delay mechanism on two existing database operations: the combination of projection and selection, and the views.

APA, Harvard, Vancouver, ISO, and other styles

41

He, Hongbo. "Implementation of nested relations in a database programming language." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0018/MQ37126.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Harms, Douglas Eugene. "The influence of software reuse on programming language design /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487683049374373.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Gee, David Malcolm. "A visual programming language for real-time systems." Thesis, Northumbria University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Phillips, Brenton A. (Brenton Asher) 1976. "Metaglue : a programming language for multi-agent systems." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80557.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (p. 83-84).
by Brenton A. Phillips.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

46

Sos, Garrett Tim 1959. "Design of an object-oriented language syntax for UIL, the User Interface Language of the Space Station FREEDOM." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277182.

Full text

Abstract:

The design of a new computer language, called the User Interface Language (UIL), is analyzed and evaluated by coding a representative procedure. UIL will provide the man-machine interface for command procedures on the Space Station FREEDOM. The UIL procedure written is modeled after an operational procedure used in the Space Shuttle program. This work provides a concrete test case to verify that UIL can be used to implement procedures for the Space Station. The object oriented approach taken with UIL is based on the successful application of these concepts for a variety of other software tools in operation today. Three major enhancements are proposed in this thesis: event handlers, data structures, and class/object creation capabilities. The addition of these capabilities changes the character of UIL from an object manipulation language to an object based language. The new capabilities, if adopted, will profoundly change the future of UIL.

APA, Harvard, Vancouver, ISO, and other styles

47

Vaikakul, Savalai 1976. "The linguistic exploration of children : playing with language through computer programming." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/62940.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Program in Media Arts & Sciences, 1999.
Includes bibliographical references (leaf 49).
Children's intuitions about the grammar of their language are resources which children can use to leverage understanding of formal grammatical concepts. In this thesis, I demonstrate how the Logo programming environment can be used to encourage and support children's intuitive explorations in the domain of formal linguistics. Computer programming was used to create a meaningful context in which formal grammatical concepts were introduced to children through the engagement and mobilization of their linguistic intuitions. To initially engage and mobilize children's linguistic intuitions, I made a computer program in which children could play at using their intuitions about the English language to figure out the basis of a turtle character's linguistic judgments. In the context of working to understand how my program was made, children arrived at a meaningful understanding of the formal linguistic concepts I had used to construct my computer program. Furthermore, children personally appropriated the formal linguistic concepts for the purpose of modifying my original program and making their own computer programs about language.
by Savalai Vaikakul.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

48

Lundén, Daniel. "Delayed sampling in the probabilistic programming language Anglican." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210756.

Full text

Abstract:

Many probabilistic inference algorithms, both exact and approximate, have been developed to run efficiently on various probabilistic models in the recent decades. For many probabilistic models, exact inference is, however, infeasible or impossible. As such, approximate algorithms are often necessary. In this thesis, a method for partially applying exact inference in probabilistic programming languages using Monte Carlo inference algorithms is introduced and formalized. More specifically, this method allows for conditioning on observations in the probabilistic program before performing sampling, where applicable. We show that this method, called delayed sampling, can be used to reduce mean squared error of estimators based on samples generated by probabilistic programs. We also show that delayed sampling never leads to an increase in mean squared error of estimators. An evaluation is performed with an implementation of delayed sampling in the probabilistic programming language Anglican. The results demonstrate clear reductions in mean squared error for simple examples, but the overhead is also shown to be quite substantial for the Anglican implementation.
Många probabilistiska inferensalgoritmer, både exakta och approximativa, har utvecklats för att fungera effektivt på olika probabilistiska modeller under de senaste decennierna. För många probabilistiska modeller är exakt inferens emellertid otänkbar eller omöjlig. På grund av detta är ofta approximativa algoritmer nödvändiga. I denna avhandling introduceras och formaliseras en metod för att delvis tillämpa exakt inferens i probabilistiska programmeringsspråk med Monte Carlo-inferensalgoritmer. Mer specifikt tillåter denna metod att konditionera på observationer i det probabilistiska programmet innan provtagning utförs, där så är tillämpligt. Vi visar att den här metoden, som kallas fördröjd provtagning, kan användas för att minska genomsnittliga kvadratiska fel för estimatorer som baseras på prover genererade av probabilistiska program. Vi visar också att fördröjd provtagning aldrig leder till en ökning av genomsnittliga kvadratiska fel för estimatorer. En utvärdering utförs med en implementering av fördröjd provtagning i det probabilistiska programmeringsspråket Anglican. Resultaten visar tydliga minskningar i genomsnittligt kvadratfel för enkla exempel, men beräkningskostnaderna visar sig också vara ganska betydande för implementationen i Anglican.

APA, Harvard, Vancouver, ISO, and other styles

49

Nguyen, Hoang Vinh. "Steve - A Programming Language for Packet Processing." University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1467985307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Wu, Xiaoqing. "Component-based language implementation with object-oriented syntax and aspect-oriented semantics." Birmingham, Ala. : University of Alabama at Birmingham, 2007. http://www.mhsl.uab.edu/dt/2007p/wu.pdf.

Full text

Abstract:

Thesis (Ph. D.)--University of Alabama at Birmingham, 2007.
Additional advisors: Jeff Gray, Marjan Mernik, Alan Sprague, Murat Tanik. Description based on contents viewed June 25, 2007; title from title screen. Includes bibliographical references (p. 132-138).

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Computer programming language'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles