Gotowe bibliografie tematyczne / Programming language semantics

Gotowa bibliografia na temat „Programming language semantics”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 13 lutego 2022

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Programming language semantics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Programming language semantics"

Schmidt, David A. "Programming language semantics". ACM Computing Surveys 28, nr 1 (marzec 1996): 265–67. http://dx.doi.org/10.1145/234313.234419.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Riecke, Jon G. "Programming language semantics". ACM SIGPLAN Notices 32, nr 1 (styczeń 1997): 106–9. http://dx.doi.org/10.1145/251595.251613.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Steingartner, William. "On some innovations in teaching the formal semantics using software tools". Open Computer Science 11, nr 1 (17.12.2020): 2–11. http://dx.doi.org/10.1515/comp-2020-0130.

Pełny tekst źródła

Streszczenie:

AbstractIn this work we discuss the motivation for innovations and need of a teaching tool for the visualization of the natural semantics method of imperative programming languages. We present the rôle of the teaching software, its design, development and use in the teaching process. Our software module is able to visualize the natural semantics evaluation of programs. It serves as a compiler with environment that can visually interpret simple programming language Jane statements and to depict them into a derivation tree that represents the semantic method of natural semantics. A formal definition of programming language Jane used in the teaching of formal semantics and production rules in natural semantics for that language are shown as well. We present, how the presented teaching tool can provide particular visual steps in the process of finding the meaning of well-structured input program and to depict complete natural-semantic representation of an input program.

Style APA, Harvard, Vancouver, ISO itp.

MLNAŘÍK, HYNEK. "SEMANTICS OF QUANTUM PROGRAMMING LANGUAGE LANQ". International Journal of Quantum Information 06, supp01 (lipiec 2008): 733–38. http://dx.doi.org/10.1142/s0219749908004031.

Pełny tekst źródła

Streszczenie:

We show a memory model of an imperative concurrent quantum programming language LanQ. The memory model is used to specify the shape of semantical structure upon which the language operational semantics is defined. We also outline the language abilities in the area of formal verification on an example implementation of teleportation protocol.

Style APA, Harvard, Vancouver, ISO itp.

Abadi, Martín. "Secrecy in Programming-Language Semantics". Electronic Notes in Theoretical Computer Science 20 (1999): 80–94. http://dx.doi.org/10.1016/s1571-0661(04)80068-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

COSTANTINI, STEFANIA. "SEMANTICS OF A METALOGIC PROGRAMMING LANGUAGE". International Journal of Foundations of Computer Science 01, nr 03 (wrzesień 1990): 233–47. http://dx.doi.org/10.1142/s0129054190000175.

Pełny tekst źródła

Streszczenie:

This paper presents the declarative and procedural semantics of Reflective Prolog, a new logic language able to represent metaknowledge and use it in the proof process via an extended resolution procedure including forms of implicit reflection. The declarative semantics of a Reflective Prolog definite program is provided in terms of the Least Reflective Herbrand Model of the program, characterized by means of a suitable mapping. The extended resolution is then shown to be sound and complete with respect to the Least Reflective Herband Model.

Style APA, Harvard, Vancouver, ISO itp.

Steingartner, William, i Valerie Novitzká. "Categorical model of structural operational semantics for imperative language". Journal of information and organizational sciences 40, nr 2 (9.12.2016): 203–19. http://dx.doi.org/10.31341/jios.40.2.3.

Pełny tekst źródła

Streszczenie:

Definition of programming languages consists of the formal definition of syntax and semantics. One of the most popular semantic methods used in various stages of software engineering is structural operational semantics. It describes program behavior in the form of state changes after execution of elementary steps of program. This feature makes structural operational semantics useful for implementation of programming languages and also for verification purposes. In our paper we present a new approach to structural operational semantics. We model behavior of programs in category of states, where objects are states, an abstraction of computer memory and morphisms model state changes, execution of a program in elementary steps. The advantage of using categorical model is its exact mathematical structure with many useful proved properties and its graphical illustration of program behavior as a path, i.e. a composition of morphisms. Our approach is able to accentuate dynamics of structural operational semantics. For simplicity, we assume that data are intuitively typed. Visualization and facility of our model is not only a new model of structural operational semantics of imperative programming languages but it can also serve for education purposes.

Style APA, Harvard, Vancouver, ISO itp.

Bruce, Kim B. "A paradigmatic object-oriented programming language: Design, static typing and semantics". Journal of Functional Programming 4, nr 2 (kwiecień 1994): 127–206. http://dx.doi.org/10.1017/s0956796800001039.

Pełny tekst źródła

Streszczenie:

AbstractTo illuminate the fundamental concepts involved in object-oriented programming languages, we describe the design of TOOPL, a paradigmatic, statically-typed, functional, object-oriented programming language which supports classes, objects, methods, hidden instance variables, subtypes and inheritance.It has proven to be quite difficult to design such a language which has a secure type system. A particular problem with statically type checking object-oriented languages is designing typechecking rules which ensure that methods provided in a superclass will continue to be type correct when inherited in a subclass. The type-checking rules for TOOPL have this feature, enabling library suppliers to provide only the interfaces of classes with actual executable code, while still allowing users to safely create subclasses. To achieve greater expressibility while retaining type-safety, we choose to separate the inheritance and subtyping hierarchy in the language.The design of TOOPL has been guided by an analysis of the semantics of the language, which is given in terms of a model of the F-bounded second-order lambda calculus with fixed points at both the element and type level. This semantics supports the language design by providing a means to prove that the type-checking rules are sound, thus guaranteeing that the language is type-safe.While the semantics of our language is rather complex, involving fixed points at both the element and type level, we believe that this reflects the inherent complexity of the basic features of object-oriented programming languages. Particularly complex features include the implicit recursion inherent in the use of the keyword, self, to refer to the current object, and its corresponding type, MyType. The notions of subclass and inheritance introduce the greatest semantic complexities, whereas the notion of subtype is more straightforward to deal with. Our semantic investigations lead us to recommend caution in the use of inheritance, since small changes to method definitions in subclasses can result in major changes to the meanings of the other methods of the class.

Style APA, Harvard, Vancouver, ISO itp.

GUO, MINYI. "DENOTATIONAL SEMANTICS OF AN HPF-LIKE DATA-PARALLEL LANGUAGE MODEL". Parallel Processing Letters 11, nr 02n03 (czerwiec 2001): 363–74. http://dx.doi.org/10.1142/s0129626401000658.

Pełny tekst źródła

Streszczenie:

It is important for programmers to understand the semantics of a programming language. However, little work has been done about the semantic descriptions of HPF-like data-parallel languages. In this paper, we first define a simple language [Formula: see text], which includes the principal facilities of a data-parallel language such as HPF. Then we present a denotational semantic model of [Formula: see text]. It is useful for understanding the components of an HPF-like language, such as data alignment and distribution directives, forall data-parallel statements.

Style APA, Harvard, Vancouver, ISO itp.

Domanov, Oleg. "ON TYPE-THEORETICAL FORMALIZATION OF SITUATION SEMANTICS". Respublica literaria, RL. 2021. vol. 2. no. 3 (15.09.2021): 32–41. http://dx.doi.org/10.47850/rl.2021.2.3.32-41.

Pełny tekst źródła

Streszczenie:

Situation semantics is an effective instrument for analysing semantical aspects of natural languages with explicit dependence on contexts, like referential opacity of belief contexts etc. Making use of type-theoretical approaches not only makes its formalism more practical in many ways, but also facilitates its migration to computer systems, specifically, the formalization in functional programming languages. The article deals with a prototype of the type theoretical language of situation semantics, implemented on the basis of the language Racket. It decribes principal approaches, methods of solving some problems of formal semantics as well as issues that need to be addressed.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Programming language semantics"

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

Pełny tekst źródła

Streszczenie:

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 idea that these transitions represent an intuitive idea of a computation step. Unfortunately this definition produces unsatisfactory animations. However, it can be augmented to give one that better satisfies the needs of the user. Both of these definitions are given in the relational style of structured operational semantics. The first definition is based on an equivalence between the relational and transitional styles; I give a definition of this equivalence. I also discuss the relation between the definition of a step and the choice of semantic formalism. Views of a program in mid-evaluation can be defined by extending the specification of the programming language to include semantic display rules. Each semantic display rule specifies the display of one sub-phrase of the program inmid-evaluation. This approach is powerful enough to define a wide range of views. I also show how the definition of a step can be parameterised on a view. More advanced operations can also be defined in terms of this theory. These operations and the views mentioned in the previous paragraph cover most of the features found in existing animators. This indicates that the theory is powerful enough to specify useful systems. The main feature that is not yet provided is the ability to define views that are specific to a single program. These ideas have been implemented in a system called The Animator Generator. Animators produced by The Animator Generator support multiple views and the advanced operations mentioned here. I give a brief description of this system. I finish by discussing how this work could be developed further.

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 devidamente definida. Os trabalhos desenvolvidos até agora foram baseados em noções operacionais, e apresentam diferentes interpretações do Prosoft Algébrico. Esta dissertação apresenta uma especificação de semântica denotacional para o Prosoft Algébrico, compreendendo, entre outras características, sua primitiva de comunicação entre tipos de dados, chamada ICS, e sua notação gráfica para representação de instanciação de tipos abstratos de dados. Essa dissertação apresenta também um estudo sobre prototipação semântica usando a linguagem de programação Haskell. O conceito de Literate Programming e a proximidade entre Cálculo Lambda e Haskell foram cruciais no rápido desenvolvimento de uma implementação protótipo do Prosoft Algébrico, baseada na sua semântica especificada. As principais contribuições dessa dissertação incluem: uma interpretação precisa e sem ambiguidades do Prosoft Algébrico, através da especificação da sua semântica; a definição de semântica para a ICS, um conceito único (até o limite do nosso conhecimento) que fornece um mecanismo de passagem de mensagens entre tipos de dados algébricos; uma implementação protótipo do Prosoft Algébrico, que pode realmente ser utilizada para experimentar e testar a definição da linguagem e a especificação da semântica do Prosoft Algébrico; resultados sobre prototipação semântica de especificações tanto de semântica denotacional quanto de semântica operacional usando a linguagem de programação Haskell para desenvolvimento rápido de protótipos de linguagens baseados na sua semântica. Como grande parte do desenvolvimento do Ambiente Prosoft é realizado através de projetos de cooperação internacional e essa dissertação irá influenciar fortemente o seu desenvolvimento futuro, o texto foi escrito em inglês para facilitar a troca de informação entre o grupo Prosoft e seus parceiros estrangeiros.
Prosoft is a research project at Instituto de Informática da UFRGS, developed by the research group with the same name and coordinated by Professor Daltro José Nunes. The project’s goal is to develop a full software development environment, the Prosoft Environment, based on the concepts of Models, Lambda Calculus, Abstract Data Types and Object orientation. One of the components of the Prosoft Environment is its algebraic specification language: Algebraic Prosoft. Although being the basis and theme of several works in the Prosoft research group, Algebraic Prosoft doesn’t have its semantics properly defined. Works done up to now were based on operational notions and presented different interpretations of Algebraic Prosoft. This thesis presents a denotational semantics specification for Algebraic Prosoft, comprising, among other features, its “inter-data type” communication primitive, called ICS, and its graphical notation for representing instantiations of abstract data types. This thesis also presents a study of semantic prototyping using the Haskell programming language. The concept of Literate Programing and the proximity between lambda calculus and Haskell were crucial to the rapid development of a prototype implementation of Algebraic Prosoft, based on its specified semantics. This thesis’ main contributions include: a precise and unambiguous interpretation of Algebraic Prosoft, through a semantics specification; the definition of semantics to the ICS, a unique (to the best of our knowledge) concept that provides a messagepassing mechanism between algebraic data types; a prototype implementation of Algebraic Prosoft, which can actually be used to experiment and test the Algebraic Prosoft language definition and semantics specification; results regarding semantics prototyping of both denotational and operational semantics specifications using the Haskell programming language for rapid development of semantics-based prototypes of languages. Since a large portion of Prosoft Environment’s development is done through international cooperation projects and this thesis will strongly influence its future development, the text was written in English in order to facilitate the information exchange between the Prosoft research group and its foreign partners.

Style APA, Harvard, Vancouver, ISO itp.

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

Pełny tekst źródła

Streszczenie:

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. However, it is not easy to design a probabilistic programming language correctly and define the meaning of programs expressible in it. Moreover, the inference algorithms used by probabilistic programming systems usually lack formal correctness proofs and bugs have been found in some of them, which limits the confidence one can have in the results they return. In this work, we apply ideas from the areas of programming language theory and statistics to show that probabilistic programming can be a reliable tool for Bayesian inference. The first part of this dissertation concerns the design, semantics and type system of a new, substantially enhanced version of the Tabular language. Tabular is a schema-based probabilistic language, which means that instead of writing a full program, the user only has to annotate the columns of a schema with expressions generating corresponding values. By adopting this paradigm, Tabular aims to be user-friendly, but this unusual design also makes it harder to define the syntax and semantics correctly and reason about the language. We define the syntax of a version of Tabular extended with user-defined functions and pseudo-deterministic queries, design a dependent type system for this language and endow it with a precise semantics. We also extend Tabular with a concise formula notation for hierarchical linear regressions, define the type system of this extended language and show how to reduce it to pure Tabular. In the second part of this dissertation, we present the first correctness proof for a Metropolis-Hastings sampling algorithm for a higher-order probabilistic language. We define a measure-theoretic semantics of the language by means of an operationally-defined density function on program traces (sequences of random variables) and a map from traces to program outputs. We then show that the distribution of samples returned by our algorithm (a variant of “Trace MCMC” used by the Church language) matches the program semantics in the limit.

Style APA, Harvard, Vancouver, ISO itp.

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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

Pełny tekst źródła

Streszczenie:

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 problems of applying functional programming languages to real-time by defining the real-time functional programming language Ruth. The first part of the thesis concerns the identification of the particular problems associated with programming real-time systems. These can broadly be stated as a requirement that a real-time language must be able to express facts about time, a feature we have called time expressibility. The next stage is to provide time expressibility within a purely functional framework. This is accomplished by the use of timestamps on inputs and outputs and by providing a real-time clock as an input to Ruth programs. The final major part of the work is the construction of a formal definition of the semantics of Ruth to serve as a basis for formal reasoning and transformation. The framework within which the formal semantics of a real-time language are defined requires time expressibility in the same way as the real-time language itself. This is accomplished within the framework of domain theory by the use of specialised domains for timestamped objects, called herring-bone domains. These domains could be used as the basis for the definition of the semantics of any real-time language.

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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).

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Programming language semantics"

Watt, David A. Programming language syntax and semantics. New York: Prentice Hall, 1991.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Muffy, Thomas, red. Programming language syntax and semantics. New York: Prentice-Hall, 1991.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kirkerud, Bjørn. Programming language semantics: Imperative and object-oriented languages. London: International Thomson Computer Press, 1997.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Main, M., A. Melton, M. Mislove i D. Schmidt, red. Mathematical Foundations of Programming Language Semantics. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19020-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Marcotty, Michael. Programming language landscape: Syntax, semantics, and implementation. Wyd. 2. Chicago: Science Research Associates, 1986.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Eijck, J. van. Computational semantics with functional programming. Cambridge: Cambridge University Press, 2010.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Benedetti, Giulio. The fundamental structural elements of language: Operational semantics. Hauppauge, N.Y: Nova Science Publishers, Inc., 2010.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Schmidt, DavidA. Denotational semantics: A methodology for language development. Boston (Mass.): Allyn and Bacon, 1986.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Felleisen, Matthias. Semantics engineering with PLT Redex. Cambridge, MA: MIT Press, 2009.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Denotational semantics: A methodology for language development. Dubuque, Iowa: Wm.C. Brown, 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Programming language semantics"

Venables, W. N., i B. D. Ripley. "The S Language: Syntax and Semantics". W S Programming, 5–38. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-0-387-21856-4_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bloss, Adrienne, i Paul Hudak. "Path semantics". W Mathematical Foundations of Programming Language Semantics, 476–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19020-1_26.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Consel, Charles, i Siau Cheng Khoo. "Semantics-directed generation of a Prolog compiler". W Programming Language Implementation and Logic Programming, 135–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54444-5_94.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Pleban, Uwe F., i Peter Lee. "High-level semantics". W Mathematical Foundations of Programming Language Semantics, 550–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19020-1_29.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Madeira, Alexandre, Manuel A. Martins i Luís S. Barbosa. "Boilerplates for Reconfigurable Systems: A Language and Its Semantics". W Programming Languages, 75–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40922-6_6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rodríguez, Leonardo. "An Intrinsic Denotational Semantics for a Lazy Functional Language". W Programming Languages, 75–80. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24012-1_6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Boulanger, Dmitri, Maurice Bruynooghe i Marc Denecker. "Abstracting s-semantics using a model-theoretic approach". W Programming Language Implementation and Logic Programming, 432–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58402-1_30.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gamatié, Abdoulaye. "Formal Semantics". W Designing Embedded Systems with the SIGNAL Programming Language, 95–108. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-1-4419-0941-1_7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mosses, Peter D. "The Varieties of Programming Language Semantics". W Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, 624–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44929-9_49.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rutten, J. J. M. M. "Nonwellfounded sets and programming language semantics". W Lecture Notes in Computer Science, 193–206. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55511-0_9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Programming language semantics"

Gorodetskiy, A. D. "NEXTGEN: PROGRAMMING LANGUAGE WITH PROGRAMMABLE SEMANTICS". W V International Scientific and Technical Conference "Radio Engineering, Electronics and Communication". Omsk Scientific-Research Institute of Instrument Engineering, 2019. http://dx.doi.org/10.33286/978-5-6041917-2-9.286-287.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Martini, Alfio. "Programming Language Semantics with Isabelle/HOL". W 2013 2nd Workshop-School on Theoretical Computer Science (WEIT). IEEE, 2013. http://dx.doi.org/10.1109/weit.2013.29.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Laird, J. "Game Semantics for a Polymorphic Programming Language". W 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010). IEEE, 2010. http://dx.doi.org/10.1109/lics.2010.32.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Libicki, Daniel Gakh. "Semantics of persistence in the glib programming language". W Companion to the 21st ACM SIGPLAN conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1176617.1176653.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

WU, HENGYANG, i YIXIANG CHEN. "THE PARTIAL CORRECTNESS SEMANTICS OF IMPERATIVE FUZZY PROGRAMMING LANGUAGE". W Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0032.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Srinivasan, Venkatesh, i Thomas Reps. "Synthesis of machine code from semantics". W PLDI '15: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2737924.2737960.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tan, Antoine Tran, i Hartmut Kaiser. "Extending C++ with co-array semantics". W PLDI '16: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2935323.2935332.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lahav, Ori, i Roy Margalit. "Robustness against release/acquire semantics". W PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3314221.3314604.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Park, Daejun, Andrei Stefănescu i Grigore Roşu. "KJS: a complete formal semantics of JavaScript". W PLDI '15: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2737924.2737991.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Montesi, Danilo, i Riccardo Torlone. "A Framework for the Specification of Active Rule Language Semantics". W Proceedings of the Fifth International Workshop on Database Programming Languages. BCS Learning & Development, 1995. http://dx.doi.org/10.14236/ewic/dbpl1995.22.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!