Dissertations / Theses: 'Pl/1 (Programming Language)'

1

Eshghi, Kave. "Meta-language in logic programming." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38302.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dulay, Naranker. "A configuration language for distributed programming." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46287.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Foster, Ian. "Parlog as a systems programming language." Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/47065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

McCabe, Francis Gregory Christopher. "Logic and objects : language, application and implementation." Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47568.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

NEHAB, DIEGO FERNANDES. "THE IMPLEMENTATION OF THE SLOTH PROGRAMMING LANGUAGE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2002. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6521@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Este trabalho descreve uma nova linguagem de programação funcional e sua implementação. Sloth é uma linguagem funcional pura interpretada, não estrita, que suporta funções de ordem elevada como valores de primeira classe, tipos de dados estruturados e definições múltiplas de funções selecionadas por casamento de padrões. Sloth foi criada para o uso no meio acadêmico, em atividades relacionadas ao uso e à implementação de linguagens funcionais. Sendo assim, durante o desenvolvimento de Sloth, uma grande preocupação com a simplicidade direcionou tanto a especificação da linguagem quanto sua implementação. Como resultado, a sintaxe da linguagem é modesta, mas expressiva o bastante para permitir seu uso em aplicações práticas. Da mesma forma, a grande simplicidade e portabilidade de sua implementação não prejudicam severamente sua eficiência. As principais contribuições do trabalho são o projeto e desenvolvimento de Sloth, uma otimização à redução de grafos combinatórios como alternativa ao uso dos combinadores de Turner, uma arquitetura inovadora para a implementação de linguagens funcionais interpretadas, baseada no uso cooperativo de duas linguagens de programação, e uma análise comparativa entre a eficiência de Sloth e outras linguagens semelhantes.
This work describes a new functional programming language and its implementation. Sloth is a non-strict purely functional interpreted programming language, which supports high order functions as first class values, structured data types, and pattern-matching based function definitions. Sloth was created for academical use in activities related to the use and to the implementation of functional programming languages. Therefore, there has been a great concern with the simplicity of both the language specification and its implementation. As a result, Sloth's syntax is modest, but expressive enough for practical applications. Furthermore, the great simplicity and portability of its implementation has no serious impact on its performance. The main contributions of this work are the design and implementation of Sloth, an optimization to combinator graph reduction as an alternative to the use of Turner combinators, a new architecture for the implementation of interpreted functional programming languages, based on the cooperation between two programming languages, and the performance comparison between Sloth and similar languages.

APA, Harvard, Vancouver, ISO, and other styles

6

Gregory, S. "Design, application and implementation of a parallel logic programming language." Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

FILHO, DANTE CORBUCCI. "LISPLOG: A LANGUAGE FOR FUNCTIONAL AND LOGIC PROGRAMMING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1989. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14348@1.

Full text

Abstract:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Esta dissertação apresenta uma integração entre a programação funcional e a programação em lógica, obtida pela definição e implementação da Linguagem LispLog. Nesta nova linguagem, o resultado de uma resolução pode ser utilizado como argumento de uma função (pelo operador metalisp) e o resultado da avaliação de uma função pode ser ligado a uma variável lógica (pelo operador avalia). A construção desta linguagem foi realizada a partir da simulação, em microcomputador similar ao IBM-PC, de uma máquina com arquitetura de pilhas, chamada Máquina LispLog, e de seu compilador. A utilização desta linguagem é possível através do Sistema LispLog, que fornece um ambiente de programação orientado por menus.
This dissertation shows an integration between the function programming and logic programming, achieved through LispLog Language’s definition and implementation. In this new language the resultant of a resolution may be used as an argument of a function (through metalisp operator) and the result of a function’s avaliation may be linked to a logic variable (through avalia operator). The LispLog Language was constructed by a simulation of stack architecture machine, named LispLog Machine, and its compiler, in a microcomputer similar similar to IBM-PC. The LispLog System provides a programming environment oriented by menus, wich makes possible the use of this language

APA, Harvard, Vancouver, ISO, and other styles

8

Frost, David Philip. "The design of a natural language interface for medical expert systems." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Liu, Yi. "BoxScript : a language for teaching component-oriented programming /." Full text available from ProQuest UM Digital Dissertations, 2005. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1276391241&SrchMode=1&sid=8&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1185305902&clientId=22256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Graunke, Kenneth William. "Extensible Scheduling in a Haskell-based Operating System." PDXScholar, 2010. https://pdxscholar.library.pdx.edu/open_access_etds/1.

Full text

Abstract:

This thesis presents Lighthouse, an experimental branch of the Haskell-based House operating system which integrates Li et al.'s Lightweight Concurrency framework. First and foremost, it improves House's viability as a "real operating system" by providing a new extensible scheduler framework which makes it easy to experiment with different scheduling policies. In particular, Lighthouse extends Concurrent Haskell with thread priority and implements a priority-based scheduler which significantly improves system responsiveness when compared with GHC's normal round-robin scheduler. Even while doing this, it improves on House's claim of being "written in Haskell" by moving a whole subsystem out of the complex C-based runtime system and into Haskell itself. In addition, Lighthouse also includes an alternate, simpler implementation of Lightweight Concurrency which takes advantage of House's unique setting (running directly on uniprocessor x86 hardware). This experience sheds light on areas that need further attention before the system can truly be viable---primarily interactions between blackholing and interrupt handling. In particular, this thesis uncovers a potential case of self-deadlock and suggests potential solutions. Finally, this work offers further insight into the viability of using high-level languages such as Haskell for systems programming. Although laziness and blackholing present unique problems, many parts of the system are still much easier to express in Haskell than traditional languages such as C.

APA, Harvard, Vancouver, ISO, and other styles

11

PEREIRA, CRISTIANE SALGADO. "PETROLEUM SCHEDULING MULTIOBJECTIVE OPTIMIZATION FOR REFINERY BY GENETIC PROGRAMMING USING DOMAIN SPECIFIC LANGUAGE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35675@1.

Full text

Abstract:

A programação de produção em refinaria (scheduling) pode ser compreendida como uma sequência de decisões que buscam otimizar a alocação de recursos, o sequenciamento de atividades e a realização temporal dessas atividades, respeitando um conjunto de restrições de diferentes naturezas e visando o atendimento de múltiplos objetivos onde fatores como atendimento à demanda de produção e minimização de variações operacionais nos equipamentos coexistem na mesma função. Este trabalho propõe o uso da técnica de Programação Genética para automatizar a criação de programas que representem uma solução completa de programação de petróleo em uma refinaria dentro de um horizonte de tempo. Para a evolução destes programas foi desenvolvida uma linguagem específica para o domínio de problemas de scheduling de petróleo e aplicada de forma a representar as principais atividades do estudo de caso. Para tal, a primeira etapa consistiu da avaliação de alguns cenários de programação de produção de forma a selecionar as atividades que devessem ser representadas e como fazê-lo. No modelo proposto, o cromossomo quântico guarda a superposição de estados de todas as soluções possíveis e, através do processo evolutivo e observação dos genes quânticos, o cromossomo clássico é criado como uma sequencia linear de instruções a serem executadas. As instruções executadas representam o scheduling. A orientação deste processo é feita através de uma função de aptidão multiobjetivo que hierarquiza as avaliações sobre o tempo de operação das unidades de destilação, o prazo para descarregamento de navios, a utilização do duto que movimenta óleo entre terminal e refinaria, além de fatores como número de trocas de tanques e uso de tanques de injeção nas unidades de destilação. No desenvolvimento deste trabalho foi contemplado um estudo sobre o conjunto de parâmetros para o modelo desenvolvido com base em um dos cenários de programação selecionados. A partir desta definição, para avaliação do modelo proposto, foram executadas diversas rodadas para cinco cenários de programação de petróleo. Os resultados obtidos foram comparados com estudo desenvolvido usando algoritmos genéticos cujas atividades, no cromossomo, possuem representação por ordem. A programação genética apresentou percentual de soluções aceitas variando entre 25 por cento e 90 por cento dependendo da complexidade do cenário, sendo estes valores superiores ao obtido usando Algoritmos Genéticos em todos os cenários, com esforço computacional menor.
Refinery scheduling can be understood as a sequence of decisions that targets the optimization of available resources, sequencing and execution of activities on proper timing; always respecting restrictions of different natures. The final result must achieve multiple objectives guaranteeing co-existence of different factors in the same function, such as production demand fullfillment and minimize operational variation. In this work it is proposed the use of the genetic programming technique to automate the building process of programs that represent a complete oil scheduling solution within a defined time horizon. For the evolution of those programs, it was developed a domain specific language to translate oil scheduling instructions that was applied to represent the most relevant activities for the proposed case studies. For that, purpose first step was to evaluate a few real scheduling scenarios to select which activities needed to be represented and how to do that. On the proposed model, each quantum chromosome represents the overlapping of all solutions and by the evolutionary process (and quantum gene measurement) the classic chromosome is created as a linear sequence of scheduling instructions to be executed. The orientation for this process is performed through a multi-object fitness function that prioritizes the evaluations according to: the operating time of the atmospheric distillation unities, the oil unloading time from the ships, the oil pipeline operation to transport oil to the refinery and other parameters like the number of charge tanks switchover and injection tank used for the distillation unities. The scope of this work also includes a study about tuning for the developed model based in one of the considered scenarios. From this set, an evaluation of other different scheduling scenarios was performed to test the model. The obtained results were then compared with a developed model that uses genetic algorithms with order representation for the activities. The proposed model showed between 25 percent - 90 percent of good solutions depending on the scenario complexity. Those results exhibit higher percentage of good solutions requiring less computational effort than the ones obtained with the genetic algorithms.

APA, Harvard, Vancouver, ISO, and other styles

12

Schuhart, Henrike. "Design and implementation of a database programming language for XML-based applications." Berlin Aka, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2890794&prov=M&dok_var=1&dok_ext=htm.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Portnoff, Scott R. "(1) The case for using foreign language pedagogies in introductory computer programming instruction (2) A contextualized pre-AP computer programming curriculum| Models and simulations for exploring real-world cross-curricular topics." Thesis, California State University, Los Angeles, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10132126.

Full text

Abstract:

Large numbers of novice programmers have been failing postsecondary introductory computer science programming (CS1) courses for nearly four decades. Student learning is much worse in secondary programming courses of similar or even lesser rigor. This has critical implications for efforts to reclassify Computer Science (CS) as a core secondary subject. State departments of education have little incentive to do so until it can be demonstrated that most grade-level students will not only pass such classes, but will be well-prepared to succeed in subsequent vertically aligned coursework.

One rarely considered cause for such massive failure is insufficient pedagogic attention to teaching a programming language (PL) as a language, per se. Students who struggle with acquiring proficiency in using a PL can be likened to students who flounder in a French class due to a poor grasp of the language's syntactic or semantic features. Though natural languages (NL) and PLs differ in many key respects, a recently reported (2014) fMRI study has demonstrated that comprehension of computer programs primarily utilizes regions of the brain involved in language processing, not math. The implications for CS pedagogy are that, if PLs are learned in ways fundamentally similar to how second languages (L2) are acquired, foreign language pedagogies (FLP) and second language acquisition (SLA) theories can be key sources for informing the crafting of effective PL teaching strategies.

In this regard, key features of contemporary L2 pedagogies relevant to effective PL instruction—reflecting the late 20^th-century shift in emphasis from cognitive learning that stressed grammatical knowledge, to one that facilitates communication and practical uses of the language—are: (1) repetitive and comprehensible input in a variety of contexts, and (2) motivated, meaningful communication and interaction.

Informed by these principles, four language-based strategies adapted for PL instruction are described, the first to help students acquire syntax and three others for learning semantics: (a) memorization; (b) setting components in relief; (c) transformations; and (d) ongoing exposure.

Anecdotal observations in my classroom have long indicated that memorization of small programs and program fragments can immediately and drastically reduce the occurrence of syntax errors among novice pre-AP Java programming students. A modest first experiment attempting to confirm the effect was statistically unconvincing: for students most likely to struggle, the Pearson coefficient of −0.474 (p < 0.064) suggested a low-modest inverse correlation. A follow-up study will be better designed. Still, a possible explanation for the anecdotal phenomenon is that the repetition required for proficient memorization activates the same subconscious language acquisition processes that construct NL grammars when learners are exposed to language data.

Dismal retention rates subsequent to the introductory programming course have historically also been a persistent problem. One key factor impacting attrition is a student's intrinsic motivation, which is shaped both by interest in, and self-efficacy with regards to, the subject matter. Interest involves not just CS concepts, but also context, the domains used to illustrate how one can apply those concepts. One way to tap into a wide range of student interests is to demonstrate the capacity of CS to explore, model, simulate and solve non-trivial problems in domains across the academic spectrum, fields that students already value and whose basic concepts they already understand.

An original University of California "G" elective (UCOP "a-g" approved) pre-AP programming course along these principles is described. In this graphics-based Processing course, students are guided through the process of writing and studying small dynamic art programs, progressing to mid-size graphics programs that model or simulate real-world problems and phenomena in geography, biology, political science and astronomy. The contextualized course content combined with the language-specific strategies outlined above address both interest and self-efficacy. Although anecdotally these appear to have a positive effect on student understanding and retention, studies need to be done on a larger scale to validate these outcomes.

Finally, a critique is offered of the movement to replace rigorous secondary programming instruction with survey courses—particularly Exploring Computer Science and APCS Principles—under the guise of "democratizing" secondary CS education or to address the severe and persistent demographic disparities. This group of educators has promulgated a nonsensical fiction that programming is simply one of many subdisciplines of the field, rather than the core skill needed to understand all other CS topics in any deep and meaningful way. These courses present a facade of mitigating demographic disparities, but leave participants no better prepared for subsequent CS study.

APA, Harvard, Vancouver, ISO, and other styles

14

Faveri, Cristiano de. "UMA LINGUAGEM ESPECÍFICA DE DOMÍNIO PARA CONSULTA EM CÓDIGO ORIENTADO A ASPECTOS." Universidade Federal de Santa Maria, 2013. http://repositorio.ufsm.br/handle/1/5435.

Full text

Abstract:

Ensuring code quality is crucial in software development. Not seldom, developers resort to static analysis tools to assist them in both understanding pieces of code and identifying defects or refactoring opportunities during development activities. A critical issue when defining such tools is their ability to obtain information about code. Static analysis tools depend, in general, of an intermediate program representation to identify locations that meet the conditions described in their algorithms. This perspective can be enlarged when techniques of crosscutting concerns modularization, such as aspect-oriented programming (AOP) is applied. In AOP applications, a piece of code can be systematically affected, using both static and dynamic combinations. The main goal of this dissertation is the specification and the implementation of AQL, a domain-specific language (DSL) designed to search aspect-oriented code bases. AQL is a declarative language, based on object query language (OQL), which enables the task of querying elements, relationships and program metrics to support the construction of static analysis and code searching tools for aspect oriented programs. The language was designed in two steps. First, we built a framework (AOPJungle), responsible to extract data from aspect-oriented programs. AOPJungle performs the computation of metrics, inferences and connections between the elements of the program. In the second step, we built an AQL compiler as a reference implementation. We adopted a source-to-source transformation for this step, in which an AQL query is transformed into HQL statements before being executed. In order to evaluate the reference implementation, we developed a static analysis tool for identifying refactoring opportunities in aspect-oriented programs. This tool receives a set of AQL queries to identify potential scenarios where refactoring could be applied.
Assegurar a qualidade de código é um ponto crucial durante o desenvolvimento de software. Frequentemente, os desenvolvedores recorrem às ferramentas de análise estática para auxiliá-los tanto na compreensão de código, quanto na identificação de defeitos ou de oportunidades de refatoração durante o ciclo de desenvolvimento de aplicações. Um dos pontos críticos na definição de tais ferramentas está na sua capacidade de obter informações a respeito de código. As ferramentas de análise estática dependem, em geral, de uma representação intermediária de um programa para identificar situações que atendam às condições necessárias descritas em seus algoritmos. Esse panorama se amplia com o uso de técnicas de modularização de interesses transversais, tais como a programação orientada a aspectos (POA), na qual um código pode ser afetado de forma sistêmica, por meio de combinações estáticas e dinâmicas. O principal objetivo desta dissertação é a especificação e implementação de AQL, uma DSL (linguagem específica de domínio) para a realização de busca em código orientado a aspectos. A AQL é uma linguagem declarativa, baseada em linguagem de busca em objetos (OQL) e que permite consultar elementos, relações, derivações e métricas de um programa orientado a aspectos (OA), a fim de apoiar a construção de ferramentas de análise estática e de pesquisa em código. O projeto de implementação da linguagem foi realizado em duas etapas. Primeiro, foi criado um framework (AOPJungle) para a extração de dados de programas OA. O AOPJungle além de extrair dados de programas OA, realiza a computação de métricas, inferências e ligações entre os elementos de um programa. Na segunda etapa, um compilador de referência para AQL foi construído. A abordagem adotada foi a transformação fonte a fonte, sendo uma consulta AQL transformada em uma consulta HQL (Hibernate Query Language) antes de sua execução. A fim de avaliar a implementação proposta, uma ferramenta de análise estática para identificação de oportunidades de refatoração em programas AO foi elaborada, usando a AQL para a busca de dados sobre esses programas.

APA, Harvard, Vancouver, ISO, and other styles

15

Muñoz, María Eugenia. "Expanding the televisual borders the emergence of Latino-themed programming in contemporary English-language television /." Diss., Restricted to subscribing institutions, 2009. http://proquest.umi.com/pqdweb?did=1973583891&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Long, Wendy. "CATY : an ASN. 1-C++ translator in support of distributed object-oriented applications /." Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-10242009-020105/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Ozcan, Mehmet. "The Emergence Of Temporal Elements In Narrative Units Produced By Children From 3 To 9 Plus 13." Phd thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606122/index.pdf.

Full text

Abstract:

The general aim of this descriptive study is to investigate how children from 3 to 9 plus 13- year-olds and adults use temporal elements to organize the macro temporal structure of narratives. In order to achieve this general aim, it specifically delineates how the emergence of story units differ relative to age
how the emergence of temporal elements differ relative to age and story units
and how the function of each temporal element differs relative to age and story unit in the narratives elicited from children from 3 to 9 plus 13-year-olds and adults, using Mercer Mayer&
#146
s (1966) wordless, picture-book Frog, where are you? as stimulus. Participants are 98 children from 3 to 9-yearolds, as 14 informants in each age group
fourteen 13-year-olds and 14 adults. The orally collected data were transcribed and episode boundaries were coded according to Labov&
#146
s (1972) story grammar. The occurrence of each temporal element within the coded episodes was counted. Frequency of each temporal element relative to age and story unit was identified. Functions of each temporal element relative to age and story units were analyzed. A great majority of the 3- and 4-year-olds produce narratives that do not count a story. 5- year-olds produce narratives that can be considered a story, however they fail to produce internal components of episodes. 7-year-olds are observed to produce episodes that contain necessary internal components. The emergence and function of temporal elements show differences relative to age and story unit.

APA, Harvard, Vancouver, ISO, and other styles

18

Guthrie, Thomas G. "Design, implementation, and testing of a software interface between the AN/SPS-65(V)1 radar and the SRC-6E reconfigurable computer." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FGuthrie.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Ferreira, Cleverson Avelino. "Linguagem e compilador para o paradigma orientado a notificações (PON): avanços e comparações." Universidade Tecnológica Federal do Paraná, 2015. http://repositorio.utfpr.edu.br/jspui/handle/1/1414.

Full text

Abstract:

Atuais paradigmas correntes de programação de software, mais precisamente o Paradigma Imperativo (PI) e o Paradigma Declarativo (PD), apresentam deficiências que afetam o desempenho das aplicações e a obtenção de “desacoplamento” (ou acoplamento mínimo) entre elementos de software. Com o objetivo de amenizar essas deficiências, foi desenvolvido o Paradigma Orientado a Notificações (PON). O PON se inspira nos conceitos do PI (e.g. objetos) e do PD (e.g. base de fatos e regras), mas altera a essência da execução ou inferência lógica-causal. Basicamente, o PON usa objetos para tratar de fatos e regras na forma de composições de outros objetos menores que, entretanto, apresentam características comportamentais de certa autonomia, independência, reatividade e colaboração por meio de notificações pontuais para fins de inferência. Isto dito, salienta-se que a materialização dos conceitos do PON se deu por meio de um arquétipo ou Framework elaborado em linguagem de programação C++. Tal materialização do PON vem sendo utilizada como uma alternativa para o desenvolvimento de aplicações sob o domínio desse paradigma e possibilitou, de fato, a criação de aplicações para ambientes computacionais usuais baseados na chamada arquitetura Von Neumann. Apesar destas contribuições para com a sua materialização, o desenvolvimento de aplicações no PON ainda não apresentava resultados satisfatórios em termos de desempenho tal qual deveria a luz do seu cálculo assintótico, nem a facilidade de programação que seria uma das suas características principais. Nesse âmbito, o presente trabalho propõe como evolução para o estado da técnica do PON a criação de uma linguagem e compilador para o paradigma. Sendo assim, este trabalho apresenta a definição da linguagem criada com a utilização de exemplos práticos guiados pelo desenvolvimento de aplicações. Subsequentemente são apresentados detalhes do compilador bem como sua estrutura. Para demonstrar a evolução do estado da técnica do paradigma, no tocante a desempenho (e.g. tempo de processamento) e facilidade de programação foram realizados estudos comparativos com a utilização da linguagem e compilador. Os estudos comparativos foram guiados com a elaboração de dois softwares denominados aplicação Mira ao Alvo e aplicação de Vendas. Essas aplicações foram desenvolvidas com base na linguagem PON e foram realizados experimentos simulando sequências de execução com o intuito de avaliar o tempo de processamento para o resultado gerado pelo compilador PON. Ainda, tais experimentos possibilitaram a avaliação de maneira subjetiva da linguagem de programação PON no tocante a facilidade de programação. Deste modo, foi possível observar com tais estudos comparativos que os resultados apresentados pelo compilador PON foram satisfatórios quando comparados aos resultados obtidos pelo Framework e por aplicações equivalentes desenvolvidas baseadas no Paradigma Orientado a Objetos (POO).
The current software development paradigms, specifically the Imperative Paradigm (IP) and the Declarative Paradigm (DP), have weaknesses that affect the applications performance and decoupling (or minimal coupling) between the software modules. In order to provide a solution regarding these weaknesses, the Notification Oriented Paradigm (NOP) was developed. NOP is inspired by the concepts of the IP (e.g. objects) and DP (e.g. base of facts and Rules). Basically, NOP uses objects to deal with facts and Rules as compositions of other, smaller, objects. These objects have the following behavioral characteristics: autonomy, independence, responsiveness and collaboration through notifications. Thus, it’s highlighted that the realization of these concepts was firstly instantiated through a Framework developed in C++. Such NOP materialization has been used as an alternative for Application development in the domain of this paradigm and made possible, in fact, the creation of applications for typical computing environments based on Von Neumann architecture. The development of the C++ materialization of NOP has not presented satisfactory results in terms of performance as it should when taking into account its asymptotic calculation and programming facility. In this context, this work presents an evolution of NOP by creating a specific programming language, and its respective compiler, for this paradigm. Therefore, this work presents the language definition and the details of the development of its compiler. To evaluate the evolution regarding to performance (e.g. processing time) and programming facility, some comparative studies using the NOP language and compiler are presented. These comparative studies were performed by developing two software applications called Target and Sales Application. These applications have been developed based on NOP language, and the experiments were performed simulating sequences of execution in order to evaluate the processing time for the generated results by NOP compiler. Still, these experiments allowed the evaluation of NOP programming language, in a subjective way, regarding to ease programming. Thus, with such comparative studies, it was possible to observe that the results presented by the compiler NOP were satisfactory when compared to the results achieved via Framework and for equivalent applications developed based on the Oriented Object Paradigm (OOP).

APA, Harvard, Vancouver, ISO, and other styles

20

Melo, Luiz Carlos Viana. "Adaptação do paradigma orientado a notificações para desenvolvimento de sistemas fuzzy." Universidade Tecnológica Federal do Paraná, 2016. http://repositorio.utfpr.edu.br/jspui/handle/1/1814.

Full text

Abstract:

Este trabalho trata do tema de Paradigma Orientado a Notificações (PON) e sua adequação para prover suporte a conceitos fuzzy. O PON se inspira em elementos dos paradigmas imperativo e declarativo, buscando resolver inconvenientes de ambos. Ao decompor uma aplicação em uma rede de entidades computacionais menores que são executadas apenas quando necessário, o PON elimina a necessidade de realizar computações desnecessárias e alcança melhor desacoplamento lógico-causal facilitando o reaproveitamento e distribuição. Ademais, o PON permite expressar o seu conhecimento lógico-causal em alto nível, por meio de regras no formato SE-ENTÃO. Os sistemas fuzzy, por sua vez, realizam inferências em bases de conhecimento lógico-causal (regras SE-ENTÃO) que lidam com problemas que envolvem imprecisão. Uma vez que o PON utiliza regras SE-ENTÃO de uma forma alternativa, reduzindo avaliações redundantes e acoplamento, este trabalho foi realizado para identificar, propor e avaliar as mudanças necessárias a serem realizadas sobre o PON para que este possa ser utilizado no desenvolvimento de sistemas fuzzy. Após a realização da proposta, foram criadas materializações na forma de um framework em linguagem C++, e uma linguagem de programação própria (LingPONFuzzy) com suporte a inferência fuzzy. A partir delas foram criados casos de estudo e realizados diversos testes para validar a solução proposta. Os resultados dos testes mostram uma redução significativa no número de regras avaliadas em relação a um sistema fuzzy desenvolvido utilizando ferramentas convencionais (frameworks), o que poderia representar uma melhoria no desempenho das aplicações.
This work proposes to adjust the Notification Oriented Paradigm (NOP) so that it provides support to fuzzy concepts. NOP is inspired by elements of imperative and declarative paradigms, seeking to solve some of the drawbacks of both. By decomposing an application into a network of smaller computational entities that are executed only when necessary, NOP eliminates the need to perform unnecessary computations and helps to achieve better logical-causal uncoupling, facilitating code reuse and application distribution over multiple processors or machines. In addition, NOP allows to express the logical-causal knowledge at a high level of abstraction, through rules in IF-THEN format. Fuzzy systems, in turn, perform logical inferences on causal knowledge bases (IF-THEN rules) that can deal with problems involving uncertainty. Since PON uses IF-THEN rules in an alternative way, reducing redundant evaluations and providing better decoupling, this research has been carried out to identify, propose and evaluate the necessary changes to be made on NOP allowing to be used in the development of fuzzy systems. After that, two fully usable materializations were created: a C++ framework, and a complete programming language (LingPONFuzzy) that provide support to fuzzy inference systems. From there study cases have been created and several tests cases were conducted, in order to validate the proposed solution. The test results have shown a significant reduction in the number of rules evaluated in comparison to a fuzzy system developed using conventional tools (frameworks), which could represent an improvement in performance of the applications.

APA, Harvard, Vancouver, ISO, and other styles

21

Bressan, Manuelle Lopes Quintas. "Scratch! um estudo de caso." Universidade Tecnológica Federal do Paraná, 2016. http://repositorio.utfpr.edu.br/jspui/handle/1/2713.

Full text

Abstract:

O estudo objetivou analisar como e se um Ambiente Visual de Programação pode contribuir apoiando os processos criativos de adolescentes, sendo uma ferramenta auxiliar para a aprendizagem pela solução de problemas, incitando novas formas de utilização das TIC na educação. O presente estudo justifica-se pela necessidade de aprofundar as questões relacionadas ao uso das TIC pelos docentes da Educação Básica e não apenas o uso de projetores e vídeos para substituir o quadro de giz, ou ferramentas de pesquisa em sites de busca apenas para transmitir informações de maneira a privilegiar as metodologias tradicionais de ensino. Como metodologia de pesquisa optou-se pela abordagem qualitativa de natureza interpretativa do tipo estudo de caso múltiplo. A apreensão dos dados foi em campo experimental por meio de questionário socioeducacional e diários de bordo, seguida da análise de conteúdos e descrição dos resultados obtidos. Os participantes do estudo foram adolescentes de 13 escolas públicas e privadas de Ensino Fundamental e do Ensino Médio no Município de Araucária-Pr. O estudo evidenciou o desenvolvimento das funções psicológicas superiores, pensamento computacional nos estudantes como atenção, memória e percepção. Estas habilidades foram observadas durante a elaboração dos projetos, por meio das habilidades de compreensão, planejamento, retrospecto e desenvolvimento de estratégias individuais e coletivas para a solução dos problemas encontrados. Este estudo se diferencia de outros já realizados com o Scratch, pois, enfatiza a busca da liberdade e criatividade dos sujeitos discentes na elaboração de projetos próprios, como estratégia para a autonomia.
The study aimed to analyze how and if a Visual Programming Environment can contribute by supporting the creative processes of adolescents, an auxiliary tool for learning by problem solving, encouraging new ways of using ICT in education. This study is justified by the need to deepen the issues related to the use of ICT in Basic Education teachers and not only the use of projectors and videos to replace the chalkboard, or research tools in search engines only to convey information in order to favor traditional teaching methodologies. As a research methodology was chosen qualitative approach to interpretation, the study of case type. The seizure of the data was in experimental field through socio-educational and daily quiz board, followed by analysis of content and description of the results obtained. Study participants were adolescents from 13 public and private elementary schools and high school in the city of Araucaria-Pr. The study showed the development of higher psychological functions, computational thinking in students such as attention, memory and perception. These skills were observed during the preparation of projects, through the comprehension skills, planning, retrospect and development of individual and collective strategies to solve the problems encountered. This study differs from others already undertaken with Scratch therefore emphasizes the pursuit of freedom and creativity of the subjects students in developing their own projects, as a strategy for autonomy.

APA, Harvard, Vancouver, ISO, and other styles

22

Choo, Young-il. "Logic from Programming Language Semantics." Thesis, 1987. https://thesis.library.caltech.edu/811/1/Choo_y_1987.pdf.

Full text

Abstract:

Logic for reasoning about programs must proceed from the programming language semantics. It is our thesis that programs be considered as mathematical objects that can be reasoned about directly, rather than as linguistic expressions whose meanings are embedded in an intermediate formalism.

Since the semantics of many programming language features (including recursion, type-free application, infinite structures, self-reference, and reflection) require models that are constructed as limits of partial objects, a logic for dealing with partial objects is required.

Using the D_∞ model of the λ-calculus, a logic (called continuous logic) for reasoning about partial objects is presented. In continuous logic, the logical operations (negation, implication, and quantification) are defined for each of the finite levels and then extended to the limit, giving us a model of type-free logic.

The triples of Hoare Logic are interpreted as partial assertions over the domain of partial states, and contradictions arising from rules for function definitions are analyzed. Recursive procedures and recursive functions are both proved using mathematical induction.

A domain of infinite lists is constructed as a model for languages with lazy evaluation and it is compared to an ordinal-heirarchic construction. A model of objects and multiple inheritance is constructed where objects are self-referential states and multiple inheritance is defined using the notion of product of classes. The reflective processor for a language with environment and continuation reflection is constructed as the projective limit of partial reflective processors of finite height.

APA, Harvard, Vancouver, ISO, and other styles

23

Madras, Alan Jeffrey. "Programming language support for distributed applications." Thesis, 1986. http://spectrum.library.concordia.ca/4019/1/ML35507.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Champlain, Michel de. "Synapse : a real-time programming language." Thesis, 1989. http://spectrum.library.concordia.ca/4373/1/ML51351.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Weisenburger, Pascal. "A Programming Language for Distributed Systems." Phd thesis, 2020. https://tuprints.ulb.tu-darmstadt.de/13500/1/DissertationPascalWeisenburger20200913.pdf.

Full text

Abstract:

Today’s software, including many everyday services, such as online streaming, search engines and social networks, is widely distributed, running on top of a network of interconnected computers. Such distributed applications are traditionally developed as separate modules for each component in the distributed system. These modules react to events, like user input or messages from the network, and in turn produce new events for the other modules. Separation into different modules is problematic because combining modules is notoriously hard and requires extensive and time-consuming integration and manual implementation of communication forces programmers to program complex event-based communication schemes among hosts – an activity which is often low-level and error-prone. The combination of the two results in obscure distributed data flows scattered among multiple modules, hindering reasoning about the system as a whole. For these reasons, despite most software today is distributed, the design and development of distributed systems remains surprisingly challenging. We present the ScalaLoci distributed programming language, our approach for taming the complexity of developing distributed applications via specialized programming language support. ScalaLoci addresses the issues above with a coherent model based on placement types that enables reasoning about distributed data flows otherwise scattered across multiple modules, supporting multiple software architectures via dedicated language features and abstracting over low-level communication details and data conversions. ScalaLoci does not force developers to modularize software along network boundaries as is traditionally the case when developing distributed systems. Instead, we propose a module system that supports encapsulating each (cross-host) functionality and defining it over abstract peer types. As a result, we disentangle modularization and distribution and we enable the definition of a distributed system as a composition of ScalaLoci modules, each representing a subsystem. Our case studies on distributed algorithms, distributed data structures, as well as on real-world distributed streaming engines show that ScalaLoci simplifies developing distributed systems, reduces error-prone communication code and favors early detection of bugs. As we demonstrate, the ScalaLoci module system allows the definition of reusable patterns of interaction in distributed software and enables separating the modularization and distribution concerns, properly separating functionalities in distributed systems.

APA, Harvard, Vancouver, ISO, and other styles

26

Guillemette, Louis-Julien. "MLPE : an extensible multi-language programming environment." Thesis, 2004. http://spectrum.library.concordia.ca/8138/1/MQ94740.pdf.

Full text

Abstract:

Sizable projects often involve the combination of multiple languages, and many projects involve the use of one or more languages designed specifically for the application. There exists a primary need, on the one hand, to facilitate the cooperation of several languages, and on the other hand, to facilitate the implementation of new ones. Correspondingly, one can identify two kinds of software: (1) mixed languages systems, which are those systems combining parts written in several languages, and (2) language prototyping tools, which are tools meant to facilitate the construction of prototype implementations of a programming language based on some formal description of it. This thesis reports an attempt at constructing a programming environment that combines the requirements of the two. The thesis presents MLPE, a programming environment designed for generic support of programming languages (i.e. meant to host an open-ended set of languages). Cross-language operability is enabled through a set of common programmatic abstractions, namely a common type system and module system. MLPE is extended to support three languages in common use, namely C, Java and Haskell. A language prototyping tool designed to complement the programming environment is also presented. The prototype implementation of a simple procedural language is constructed and put to use in the context of the programming environment.

APA, Harvard, Vancouver, ISO, and other styles

27

Blelloch, Guy. "AFL-1: A Programming Language for Massively Concurrent Computers." 1986. http://hdl.handle.net/1721.1/6953.

Full text

Abstract:

Computational models are arising is which programs are constructed by specifying large networks of very simple computational devices. Although such models can potentially make use of a massive amount of concurrency, their usefulness as a programming model for the design of complex systems will ultimately be decided by the ease in which such networks can be programmed (constructed). This thesis outlines a language for specifying computational networks. The language (AFL-1) consists of a set of primitives, ad a mechanism to group these elements into higher level structures. An implementation of this language runs on the Thinking Machines Corporation, Connection machine. Two significant examples were programmed in the language, an expert system (CIS), and a planning system (AFPLAN). These systems are explained and analyzed in terms of how they compare with similar systems written in conventional languages.

APA, Harvard, Vancouver, ISO, and other styles

28

Andrews, Alanoly Joseph. "Towards an implementation of SchemaLog : a database programming language." Thesis, 1997. http://spectrum.library.concordia.ca/512/1/MQ39984.pdf.

Full text

Abstract:

The efficient implementation of advanced database programming languages calls for investigating novel architectures and algorithms. In this thesis, we discuss our implementation of SchemaLog, a logic-based database programming language, capable of offering a powerful platform for a variety of database applications involving data/meta-data querying and restructuring. Our architecture for the implementation is based on compiling SchemaLog constructs into an extended version of relational algebra called Schema Algebra (${\cal {SA}}$). We modify the new operators in this algebra to suit our implementation, and we illustrate how a SchemaLog program can be evaluated by conversion into an expression in ${\cal {SA}}$. Based on this algebra, we develop a top-down algorithm, using the Rule/Goal Tree method, for evaluating SchemaLog programs. We then discuss three alternative storage structures for the implementation and study their effect on the efficiency of implementation. For each storage structure, we propose strategies for implementing our algebraic operators. We have implemented all these algorithms, using MicroSoft Access DBMS running on Windows 3.1, and have run an extensive set of experiments for evaluating the efficiency of alternative strategies under a varied mix of querying and restructuring operations and varying parameters on the type and size of data. We discuss the results of our experiments and make recommendations on the type of storage structures to be used.

APA, Harvard, Vancouver, ISO, and other styles

29

Rourke, Robert D. "Programming an ISDN intelligent personal workstation : an architecture and language." Thesis, 1990. http://spectrum.library.concordia.ca/4018/1/MM59164.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Zakeryfar, Maryam. "Static Analysis of a Concurrent Programming Language by Abstract Interpretation." Thesis, 2014. http://spectrum.library.concordia.ca/978365/1/Zakeryfar_PhD_S2014.pdf.

Full text

Abstract:

Static analysis is an approach to determine information about the program without actually executing it. There has been much research in the static analysis of concurrent programs. However, very little academic research has been done on the formal analysis of message passing or process-oriented languages. We currently miss formal analysis tools and techniques for concurrent process-oriented languages such as Erasmus . In this dissertation, we focus on the problem of static analysis of large Erasmus programs. This can help us toward building more reliable Erasmus software systems. Reasoning about non-deterministic large Erasmus program using static analyzer is hard. These kinds of programs can quickly exhaust the computational and memory resources of the static analyzer tool. We use Abstract Interpretation to reason about Erasmus programs. To use the Abstract Interpretation theory, we introduce a lattice for Erasmus communications and an Event Order Predictor algorithm to statically determine the order that events happen in an Erasmus program. By using fixed-point theory of lattice, we compute a safe approximation of reachable states of an Erasmus programs. We also offer a Resettable Event order Vector for Erasmus processes to realistically implement our vector for large Erasmus programs using bounded space. We believe that our formal approach is also applicable to other types of process-oriented programs and MPI programs.

APA, Harvard, Vancouver, ISO, and other styles

31

Laramée, François Dominic. "Design and implementation of a chess-playing program in the Java programming language." Thesis, 2001. http://spectrum.library.concordia.ca/1703/1/MQ68470.pdf.

Full text

Abstract:

This project describes the design and implementation of an object-oriented chess-playing program, based on current software engineering practice, recent advances, including the MTD(f) search algorithm, and time-honored techniques perfected by artificial intelligence pioneers since the late 1960's, like the transposition table, the history heuristic and an evaluation function slanted towards material advantage. Where appropriate, a comparative survey of alternative algorithms not implemented in this project is also included.

APA, Harvard, Vancouver, ISO, and other styles

32

Sivilotti, Paul. "A Verified Integration of Imperative Parallel Programming Paradigms in an Object-Oriented Language." Thesis, 1993. https://thesis.library.caltech.edu/6919/1/Sivilotti_p_1993.pdf.

Full text

Abstract:

CC++ is a parallel object-oriented programming language that uses parallel composition, atomic functions, and single-assignment variables to express concurrency. We show that this programming paradigm is equivalent to several traditional imperative communication and synchronization models, namely: semaphores, monitors, and asynchronous channels. A collection of libraries which integrates these traditional models with CC++ is specified, implemented, and formally verified.

APA, Harvard, Vancouver, ISO, and other styles

33

Wong, Yin-lam. "The implementation of the run-time system of a concurrent programming language, Pascal-C." Thesis, 1985. http://spectrum.library.concordia.ca/5156/1/MK68097.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Marsh, Jonathon. "Production and evaluation of a self-instructional module for teaching the fundamentals of computer programming in the BASIC language." Thesis, 1988. http://spectrum.library.concordia.ca/4000/1/ML44821.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Hlophe, Sihle. "The representation of minority languages on SABC 1: the case of Siswati / Sihle Hlophe." Thesis, 2014. http://hdl.handle.net/10394/11053.

Full text

Abstract:

This dissertation interrogates the representation of SiSwati programming (a minority language) on SABC 1 It critically analyses the statutory provisions in place for language parity and utilises hegemony as the theoretical framework for understanding the concept of language parity in the South African broadcasting landscape. To the researcher’s knowledge, there is limited information pertaining to this particular research topic however, most of the previous literature refers to all eleven official languages and not SiSwati specifically. Hegemony, a strand of critical theory as developed by Antonio Gramsci, will serve as the theoretical base of this study. This study falls within the framework of qualitative research. An extensive literature study of various sources and a content analysis of the relevant legislative documents form the basis of the research. SABC TV is positioned in a highly competitive, multi-channel market environment with powerful social, political and economic forces to contend with, this makes it difficult for SABC TV to fulfil its mandate of treating all eleven official languages equitably, hence languages such as SiSwati are underrepresented on national television. This study is seminal and relevant insofar as it offers a much needed insight into the plight of a marginalised language by the country’s public broadcaster.
MA (Communication Studies), North-West University, Potchefstroom Campus, 2014

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Pl/1 (Programming Language)'

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