To see the other types of publications on this topic, follow the link: Programming language semantics.

Dissertations / Theses on the topic 'Programming language semantics'

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Programming language semantics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Berry, Dave. "Generating program animators from programming language semantics." Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/10791.

Full text
Abstract:
I present a theory of program animation based on formal semantics. This theory shows how an animator for a language can be generated from a formal specification of that language. Such an animator presents a model of evaluation that is formally correct with respect to the semantics. The theory also provides a framework for comparing definitions of animation operations. The main part of the theory is the definition of an evaluation step. I compare two definitions. The first is based on the transitions used in the transitional style of structured operational semantics, and is motivated by the ide
APA, Harvard, Vancouver, ISO, and other styles
2

Azevedo, Terceiro Antonio Soares de. "Semantics for an algebraic specification language." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2006. http://hdl.handle.net/10183/8126.

Full text
Abstract:
Prosoft é um grupo de pesquisa do Instituto de Informática da UFRGS, desenvolvido pelo grupo de pesquisa homônimo e coordenado pelo Professor Daltro José Nunes. O objetivo do projeto é desenvolver um ambiente de desenvolvimento de software completo, o Ambiente Prosoft, que é baseado nos conceitos de Modelos, Cálculo Lambda, Tipos Abstratos de Dados e Orientação a Objetos. Um dos componentes do Ambiente Prosoft é sua linguagem de especificação algébrica: o Prosoft Algébrico. Apesar de ser base e tema de diversos trabalhos no grupo de pesquisa Prosoft, o Prosoft Algébrico não tem sua semântica d
APA, Harvard, Vancouver, ISO, and other styles
3

Szymczak, Marcin. "Programming language semantics as a foundation for Bayesian inference." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/28993.

Full text
Abstract:
Bayesian modelling, in which our prior belief about the distribution on model parameters is updated by observed data, is a popular approach to statistical data analysis. However, writing specific inference algorithms for Bayesian models by hand is time-consuming and requires significant machine learning expertise. Probabilistic programming promises to make Bayesian modelling easier and more accessible by letting the user express a generative model as a short computer program (with random variables), leaving inference to the generic algorithm provided by the compiler of the given language. Howe
APA, Harvard, Vancouver, ISO, and other styles
4

Botting, Richard. "Iterative construction of data modelling language semantics." Thesis, Coventry University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brown, Deryck Forsyth. "Sort inference in action semantics." Thesis, University of Glasgow, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Harrison, Dave. "Functional real-time programming : the language Ruth and its semantics." Thesis, University of Stirling, 1988. http://hdl.handle.net/1893/12116.

Full text
Abstract:
Real-time systems are amongst the most safety critical systems involving computer software and the incorrect functioning of this software can cause great damage, up to and including the loss of life. If seems sensible therefore to write real-time software in a way that gives us the best chance of correctly implementing specifications. Because of the high level of functional programming languages, their semantic simplicity and their amenability to formal reasoning and correctness preserving transformation it thus seems natural to use a functional language for this task. This thesis explores the
APA, Harvard, Vancouver, ISO, and other styles
7

Arenas-Sarmiento, Alvard Enrique. "Implementation of an asynchronous real-time programming language." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365697.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pareschi, Remo. "Type-driven natural language analysis." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/19215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.<br>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
10

Gabbay, Murdoch James. "A theory of inductive definitions with α-equivalence : semantics, implementation, programming language". Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620988.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Stark, Jamie. "Proof planning for imperative program development." Thesis, Heriot-Watt University, 2000. http://hdl.handle.net/10399/589.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Halmay, Edit. "Formal method for the retrospective specification of the functionality of existing software systems." Thesis, London South Bank University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Owei, Vesper T. "Framework for a conceptual query language for capturing relationship semantics in databases." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/30684.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Sanjabi, Sam Bakhtiar. "A semantics for aspects by compositional translation." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:9cb4d365-afb9-4f9f-b18b-59857e2c85d6.

Full text
Abstract:
We analyse the semantics of aspect-oriented extensions to functional languages by presenting compositional translations of these primitives into languages with traditional notions of state and control. As a first step, we examine an existing semantic description of aspects which allows the labelling of program points. We show that a restriction of these semantics to aspects which do not preempt the execution of code can be fully abstractly translated into a functional calculus with higher order references, but that removing this restriction requires a notion of exception handling to be added t
APA, Harvard, Vancouver, ISO, and other styles
15

Monteiro, Borba Paulo Henrique. "Semantics and refinement for a concurrent object oriented language." Thesis, University of Oxford, 1995. http://ora.ox.ac.uk/objects/uuid:33161f48-b329-4553-aed9-70f48e3c57cb.

Full text
Abstract:
FOOPS is a concurrent object oriented specification language with an executable subset. In this thesis we propose an extension of FOOPS with features for specifying systems of distributed and autonomous objects. This extension supports most features of concurrent object oriented programming, including classes of objects with associated methods and attributes, object identity, dynamic object creation and deletion, overloading, polymorphism, inheritance with overriding, dynamic binding, concurrency, nondeterminism, atomic execution, evaluation of method expressions as background processes, and o
APA, Harvard, Vancouver, ISO, and other styles
16

Mallon, Ryan Peter Kingsley. "The Semantics, Formal Correctness and Implementation of History Variables in an Imperative Programming Language." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1173.

Full text
Abstract:
Storing the history of objects in a program is a common task. Web browsers remember which websites we have visited, drawing programs maintain a list of the images we have modified recently and the undo button in a wordprocessor allows us to go back to a previous state of a document. Maintaining the history of an object in a program has traditionally required programmers either to write specific code for handling the historical data, or to use a library which supports history logging. We propose that maintaining the history of objects in a program could be simplified by providing suppor
APA, Harvard, Vancouver, ISO, and other styles
17

Alghamdi, Aliaa. "Queued and Pooled Semantics for State Machines in the Umple Model-Oriented Programming Language." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/31961.

Full text
Abstract:
This thesis describes extensions to state machines in the Umple model-oriented programming language to offer queued state machines (QSM), pooled state machines (PSM) and handing of the arrival of unexpected events. These features allow for modeling the behavior of a system or protocol in a more accurate way in Umple because they enable detecting and fixing common design errors such as unspecified receptions. In addition, they simplify the communication between communicating state machines by allowing for asynchronous calls of events and passing of messages between state machines. Also, a poole
APA, Harvard, Vancouver, ISO, and other styles
18

Jenkins, Stephen Graham. "An object oriented and visual data analysis environment : semantics and pragmatics of multi language programming." Thesis, University of the West of England, Bristol, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274390.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

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
20

Kumar, Sanjeev. "A formal semantics of teamwork and multi-agent conversations as the basis of a language for programming teams of autonomous agents /." Full text open access at:, 2006. http://content.ohsu.edu/u?/etd,17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Shadrin, Andrey [Verfasser], and Wolfgang J. [Akademischer Betreuer] Paul. "Mixed low- and high level programming language semantics and automated verification of a small hypervisor / Andrey Shadrin. Betreuer: Wolfgang J. Paul." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2012. http://d-nb.info/1052550223/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Llopard, Ivan. "Programming embedded manycore : refinement and optimizing compilation of a parallel action language for hierarchical state machines." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066157/document.

Full text
Abstract:
Afin de gérer la complexité des systèmes embarqués modernes, les langages de modélisation proposent des abstractions et des transformations adaptées au domaine. Basées sur le formalisme de machines à états hiérarchiques, connu sous le nom de Statecharts, ils permettent la modélisation du contrôle parallèle hiérarchique. Cependant, ils doivent faire à deux défis majeures quant il s'agit de la modélisation des applications à calcul intensif: le besoin des méthodes unifiées supportant des actions avec parallélisme de donnée; flots d'optimisation et génération de code à partir des modèles trop gén
APA, Harvard, Vancouver, ISO, and other styles
23

Attar, Pejman. "Towards a safe and secure synchronous language." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00920152.

Full text
Abstract:
Cette thèse propose une nouvelle approche du parallélisme et de la concurrence, posant les bases d'un langage de programmation à la fois sûr et "secure" (garantissant la sécurité des données), fondé sur une sémantique formelle claire et simple, tout en étant adapté aux architectures multi-cores. Nous avons adopté le paradigme synchrone, dans sa variante réactive, qui fournit une alternative simple à la programmation concurrente standard en limitant l'impact des erreurs dépendant du temps ("data-races"). Dans un premier temps, nous avons considéré un langage réactif d'orchestration, DSL, dans l
APA, Harvard, Vancouver, ISO, and other styles
24

Kammar, Ohad. "Algebraic theory of type-and-effect systems." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/8910.

Full text
Abstract:
We present a general semantic account of Gifford-style type-and-effect systems. These type systems provide lightweight static analyses annotating program phrases with the sets of possible computational effects they may cause, such as memory access and modification, exception raising, and non-deterministic choice. The analyses are used, for example, to justify the program transformations typically used in optimising compilers, such as code reordering and inlining. Despite their existence for over two decades, there is no prior comprehensive theory of type-and-effect systems accounting for their
APA, Harvard, Vancouver, ISO, and other styles
25

Warren, Jared. "Using Haskell to Implement Syntactic Control of Interference." Thesis, Kingston, Ont. : [s.n.], 2008. http://hdl.handle.net/1974/1237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Lallouet, Arnaud. "Modularité, validation et parallélisme de données en programmation logique." Orléans, 1996. http://www.theses.fr/1996ORLE2012.

Full text
Abstract:
La contribution de cette thèse est double: d'une part, il s'agit d'étudier le problème de la validation de propriétés déclaratives de programmes logiques dans un contexte compositionnel, d'autre part de proposer une extension de la programmation logique au parallélisme de données. L'absence de compositionnalité des sémantiques utilisées en programmation logique a engendré des difficultés a concevoir un système de modules qui lui seraient adapté, et donc des méthodes de validation modulaires. Nous nous proposons de répondre à cette question en définissant d'une part des extensions compositionne
APA, Harvard, Vancouver, ISO, and other styles
27

Das, Barman Kuntal. "Type theoretic semantics for programming languages." Nice, 2004. http://www.theses.fr/2004NICE4029.

Full text
Abstract:
La sémantique des langages de programmation donne la signification des constructions de programme. Les sémantiques opérationnelle et dénotationelle sont les deux principales approches pour la sémantique de langage de programmation. La sémantique opérationnelle est habituellement donnée par des relations inductives. La sémantique dénotationelle est donnée par des fonctions partielles. Mettre en application la sémantique dénotationelle à l’intérieur de la théorie des types est difficile car cette théorie ne supporte que les fonctions totales. Dans cette thèse nous développons une sémantique fonc
APA, Harvard, Vancouver, ISO, and other styles
28

Abou-Saleh, Faris. "A coalgebraic semantics for imperative programming languages." Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/13693.

Full text
Abstract:
In the theory of programming languages, one often takes two complementary perspectives. In operational semantics, one defines and reasons about the behaviour of programs; and in denotational semantics, one abstracts away implementation details, and reasons about programs as mathematical objects or denotations. The denotational semantics should be compositional, meaning that denotations of programs are determined by the denotations of their parts. It should also be adequate with respect to operational equivalence: programs with the same denotation should be behaviourally indistinguishable. One
APA, Harvard, Vancouver, ISO, and other styles
29

Plaice, John. "Sémantique et compilation de LUSTRE, un langage déclaratif synchrone." Grenoble INPG, 1988. http://www.theses.fr/1988INPG0032.

Full text
Abstract:
Le langage étudie est un langage de programmation des systèmes temps réel fonde sur une interprétation synchrone des réseaux a flux de données. Son compilateur a été conçu entièrement à partir de descriptions formelles de la sémantique du langage. L'originalité principale du compilateur est qu'il tient d'une part aux vérifications statiques de cohérence temporelle et d'autre part à la génération de code séquentiel, par synthèse du contrôle sous forme d'automate fini
APA, Harvard, Vancouver, ISO, and other styles
30

Wolczko, M. I. "Semantics of object-oriented languages." Thesis, University of Manchester, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Clark, Anthony Neil. "Semantic primitives for object-oriented programming languages." Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.363089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Eades, Harley D. III. "The semantic analysis of advanced programming languages." Diss., University of Iowa, 2014. https://ir.uiowa.edu/etd/1312.

Full text
Abstract:
We live in a time where computing devices power essential systems of our society: our automobiles, our airplanes and even our medical services. In these safety-critical systems, bugs do not just cost money to fix; they have a potential to cause harm, even death. Therefore, software correctness is of paramount importance. Existing mainstream programming languages do not support software verification as part of their design, but rely on testing, and thus cannot completely rule out the possibility of bugs during software development. To fix this problem we must reshape the very foundation on whic
APA, Harvard, Vancouver, ISO, and other styles
33

Royer, Véronique. "Compilation dirigee par la semantique : une methode constructive." Toulouse 3, 1986. http://www.theses.fr/1986TOU30170.

Full text
Abstract:
Dans le cadre de la generation de compilateurs dirigee par la semantique, se pose le probleme de transformer une semantique source d'un langage de programmation en une semantique objet equivalente, plus proche d'une implementation. La plupart des travaux dans ce domaine resolvent ce probleme de facon non constructive: une semantique objet est d'abord exhibee, ensuite prouvee correcte vis-a-vis de la semantique source. Le but de cette these est de montrer qu'on peut deriver une semantique objet a partir d'une semantique source d'un langage, de maniere constructive, tout en preservant certains c
APA, Harvard, Vancouver, ISO, and other styles
34

Caswell, Matthew J. A. "The action semantics of object-oriented languages." Thesis, Loughborough University, 1998. https://dspace.lboro.ac.uk/2134/28283.

Full text
Abstract:
Action Semantics is a framework for defining the semantics of languages. It is intended to be accessible to a wider audience of Computer Scientists than traditional semantics frameworks (such as Denotational Semantics). There has been little work carried out to date on the techniques required to define object-oriented languages with Action Semantics. The work presented in this thesis examines four potential approaches to defining the Action Semantics of object-oriented languages. In order to illustrate the four approaches a simple language EIL (Example Inheritance Language) is given, and descr
APA, Harvard, Vancouver, ISO, and other styles
35

Atzemoglou, George Philip. "Higher-order semantics for quantum programming languages with classical control." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:9fdc4a26-cce3-48ed-bbab-d54c4917688f.

Full text
Abstract:
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known proble
APA, Harvard, Vancouver, ISO, and other styles
36

King, Christopher T. "An axiomatic semantics for functional reactive programming." Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-042908-133033/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Tamarit, Muñoz Salvador. "Analysis Techniques for Concurrent Programming Languages." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/31651.

Full text
Abstract:
Los lenguajes concurrentes est an cada d a m as presentes en nuestra sociedad, tanto en las nuevas tecnolog as como en los sistemas utilizados de manera cotidiana. M as a un, dada la actual distribuci on de los sistemas y su arquitectura interna, cabe esperar que este hecho siga siendo una realidad en los pr oximos a~nos. En este contexto, el desarrollo de herramientas de apoyo al desarrollo de programas concurrentes se vuelve esencial. Adem as, el comportamiento de los sistemas concurrentes es especialmente dif cil de analizar, por lo que cualquier herramienta que ayude en esta tarea,
APA, Harvard, Vancouver, ISO, and other styles
38

Vittek, Marian. "Elan : un cadre logique pour le prototypage de langages de programmation avec contraintes." Nancy 1, 1994. http://www.theses.fr/1994NAN10372.

Full text
Abstract:
La thèse décrit l'étude et l'implantation du langage ELAN qui permet de spécifier, sur une base uniforme de systèmes de calcul, différents langages de programmation logique et différents résolveurs de contraintes. ELAN est basé sur l'idée que la sémantique opérationnelle de langages de programmation logique dans le sens général du terme et la résolution de contraintes peuvent être décrites d'une façon uniforme en donnant la syntaxe des formules, l'ensemble des axiomes et l'ensemble des règles de déduction. Les deux processus peuvent être vus comme l'instance du meme schéma d'application des rè
APA, Harvard, Vancouver, ISO, and other styles
39

Reid, N. K. "A formal semantics of parallel features of Fortran 95." Thesis, Queen's University Belfast, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273424.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

McIver, Linda Kathryn 1971. "Syntactic and semantic issues in introductory programming education." Monash University, School of Computer Science and Software Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8800.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

White, Alexa. "Towards a Complete Formal Semantics of Rust." DigitalCommons@CalPoly, 2021. https://digitalcommons.calpoly.edu/theses/2262.

Full text
Abstract:
Rust is a relatively new programming language with a unique memory model designed to provide the ease of use of a high-level language as well as the power and control of a low-level language while preserving memory safety. In order to prove the safety and correctness of Rust and to provide analysis tools for its use cases, it is necessary to construct a formal semantics of the language. Existing efforts to construct such a semantic model are limited in their scope and none to date have successfully captured the complete functionality of the language. This thesis focuses on the K-Rust implement
APA, Harvard, Vancouver, ISO, and other styles
42

Ayers, Robert. "Enhancing the semantic power of functional database languages." Thesis, Birkbeck (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Lindhult, Johan. "Operational Semantics for PLEX : A Basis for Safe Parallelization." Licentiate thesis, Västerås : School of Innovation, Design and Engineering, Mälardalen University, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-631.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Gruer, Juan Pablo. "Eléments de synchronisation pour un langage temps-réel de commande de procédés." Mulhouse, 1989. http://www.theses.fr/1989MULH0105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Ferreira, William. "Semantic theories for concurrent ML." Thesis, University of Sussex, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307726.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Hünke, Yorck. "Semantics and type checking of dependently-typed lazy functional programs /." Oxford : Oxford University Computing Laboratory, 2004. http://web.comlab.ox.ac.uk/oucl/publications/tr/rr-04-15.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Colledan, Andrea. "Abstract Machine Semantics for Quipper." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22835/.

Full text
Abstract:
Quipper is a domain-specific programming language for the description of quantum circuits. Because it is implemented as an embedded language in Haskell, Quipper is a very practical functional language. However, for the same reason, it lacks a formal semantics and it is limited by Haskell's type-system. In particular, because Haskell lacks linear types, it is easy to write Quipper programs that violate the non-cloning property of quantum states. In order to formalize relevant fragments of Quipper in a type-safe way, the Proto-Quipper family of research languages has been introduced over the las
APA, Harvard, Vancouver, ISO, and other styles
48

Xie, Linchi. "The design of semantic database model SDBM." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26113.

Full text
Abstract:
This thesis is mainly concerned with semantic data modelling related to database design. The domain of this research is restricted to general data modelling and the discussion is carried out at the conceptual level. The thesis assesses a number of serious modelling shortcomings of the conventional data models and reviews several basic principles and mechanisms developed in current semantic data modelling research. Based on these findings, the thesis identifies the inadequacy of the conceptualization of data modelling and develops the two-view conceptualization of data modelling. The basic ide
APA, Harvard, Vancouver, ISO, and other styles
49

Al-Hafez, Muhammad Yassin. "A semantic knowledge-based computational dictionary for support of natural language processing systems." Thesis, Cranfield University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.385765.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Crous, Theodorus. "Semantos : a semantically smart information query language." Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-11292009-190944/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!