Journal articles: 'Programming language semantics'

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

5

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

11

Hannan, John. "Extended natural semantics." Journal of Functional Programming 3, no. 2 (April 1993): 123–52. http://dx.doi.org/10.1017/s0956796800000666.

Full text

Abstract:

AbstractWe extend the definition of natural semantics to include simply typed λ-terms, instead of first-order terms, for representing programs, and to include inference rules for the introduction and discharge of hypotheses and eigenvariables. This extension, which we call extended natural semantics, affords a higher-level notion of abstract syntax for representing programs and suitable mechanisms for manipulating this syntax. We present several examples of semantic specifications for a simple functional programming language and demonstrate how we achieve simple and elegant manipulations of bound variables in functional programs. All the examples have been implemented and tested in λProlog, a higher-order logic programming language that supports all of the features of extended natural semantics.

APA, Harvard, Vancouver, ISO, and other styles

12

SELINGER, PETER. "Towards a quantum programming language." Mathematical Structures in Computer Science 14, no. 4 (August 2004): 527–86. http://dx.doi.org/10.1017/s0960129504004256.

Full text

Abstract:

We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

APA, Harvard, Vancouver, ISO, and other styles

13

HARRISON, AMELIA, and VLADIMIR LIFSCHITZ. "Relating Two Dialects of Answer Set Programming." Theory and Practice of Logic Programming 19, no. 5-6 (September 2019): 1006–20. http://dx.doi.org/10.1017/s1471068419000322.

Full text

Abstract:

AbstractThe input language of the answer set solver clingo is based on the definition of a stable model proposed by Paolo Ferraris. The semantics of the ASP-Core language, developed by the ASP Standardization Working Group, uses the approach to stable models due to Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. The two languages are based on different versions of the stable model semantics, and the ASP-Core document requires, “for the sake of an uncontroversial semantics,” that programs avoid the use of recursion through aggregates. In this paper we prove that the absence of recursion through aggregates does indeed guarantee the equivalence between the two versions of the stable model semantics, and show how that requirement can be relaxed without violating the equivalence property.

APA, Harvard, Vancouver, ISO, and other styles

14

WU, Heng-Yang. "The Semantics of Imperative Fuzzy Programming Language." Chinese Journal of Computers 36, no. 4 (March 13, 2014): 862–69. http://dx.doi.org/10.3724/sp.j.1016.2013.00862.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ghica, Dan R., and Khulood Alyahya. "On the Learnability of Programming Language Semantics." Electronic Proceedings in Theoretical Computer Science 261 (November 29, 2017): 57–75. http://dx.doi.org/10.4204/eptcs.261.7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Zamulin, A. V. "Algebraic Semantics of an Imperative Programming Language." Programming and Computer Software 29, no. 6 (November 2003): 328–37. http://dx.doi.org/10.1023/b:pacs.0000004133.80483.66.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Sulema, Y. S., and V. V. Glinskii. "Semantics and pragmatics of programming language ASAMPL." PROBLEMS IN PROGRAMMING, no. 1 (January 2020): 074–83. http://dx.doi.org/10.15407/pp2020.01.074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Laird, J. "Game semantics for a polymorphic programming language." Journal of the ACM 60, no. 4 (August 2013): 1–27. http://dx.doi.org/10.1145/2508028.2505986.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Tchier, F. "Demonic semantics: using monotypes and residuals." International Journal of Mathematics and Mathematical Sciences 2004, no. 3 (2004): 135–60. http://dx.doi.org/10.1155/s016117120420415x.

Full text

Abstract:

Relations and relational operators can be used to define the semantics of programming languages. The operations∨and∘serve to giveangelic semanticsby defining a program to go right when there is a possibility to go right. On the other hand, the demonic operations⊔and□do the opposite: if there is a possibility to go wrong, a program whose semantics is given by these operators will go wrong; it is thedemonic semantics. This type of semantics is known at least since Dijkstra's introduction of the language of guarded commands. Recently, there has been a growing interest in demonic relational semantics of sequential programs. Usually, a construct is given an ad hoc semantic definition based on an intuitive understanding of its behavior. In this note, we show how the notion ofrelational flow diagram(essentially a matrix whose entries are relations on the set of states of the program), introduced by Schmidt, can be used to give a single demonic definition for a wide range of programming constructs. This research had originally been carried out by J. Desharnais and F. Tchier (1996) in the same framework of the binary homogeneous relations. We show that all the results can be generalized by using the monotypes and the residuals introduced by Desharnais et al. (2000).

APA, Harvard, Vancouver, ISO, and other styles

20

ABRAMOV, SERGEI, and ROBERT GLÜCK. "FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS." International Journal of Foundations of Computer Science 12, no. 02 (April 2001): 171–211. http://dx.doi.org/10.1142/s0129054101000448.

Full text

Abstract:

An approach for systematically modifying the semantics of programming languages by semantics modifiers is described. Semantics modifiers are a class of programs that allow the development of general and reusable "semantics components". Language independence is achieved through the interpretive approach: an interpreter serves as a mediator between the new language and the language for which the non-standard semantics was implemented. Inverse computation, equivalence transformation and neighborhood analysis are shown to be semantics modifiers. Experiments with these modifiers show the computational feasibility of this approach. Seven modifier projections are given which allow the efficient implementation of non-standard interpreters and non-standard compilers by program specialization or other powerful program transformation methods.

APA, Harvard, Vancouver, ISO, and other styles

21

RIESCO, ADRIÁN, and JUAN RODRÍGUEZ-HORTALÁ. "Singular and plural functions for functional logic programming." Theory and Practice of Logic Programming 14, no. 1 (May 17, 2012): 65–116. http://dx.doi.org/10.1017/s147106841200004x.

Full text

Abstract:

AbstractModern functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CSs) as programs in order to define non-strict and non-deterministic functions. Two semantic alternatives have been usually considered for parameter passing with this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern FLP languages, the latter lacks some basic properties – mainly compositionality – that have prevented its use in practical FLP systems. Traditionally it has been considered that call-time choice induces a singular denotational semantics, while run-time choice induces a plural semantics. We have discovered that this latter identification is wrong when pattern matching is involved, and thus in this paper we propose two novel compositional plural semantics for CSs that are different from run-time choice.We investigate the basic properties of our plural semantics – compositionality, polarity, and monotonicity for substitutions, and a restricted form of the bubbling property for CSs – and the relation between them and to previous proposals, concluding that these semantics form a hierarchy in the sense of set inclusion of the set of values computed by them. Besides, we have identified a class of programs characterized by a simple syntactic criterion for which the proposed plural semantics behave the same, and a program transformation that can be used to simulate one of the proposed plural semantics by term rewriting. At the practical level, we study how to use the new expressive capabilities of these semantics for improving the declarative flavor of programs. As call-time choice is the standard semantics for FLP, it still remains the best option for many common programming patterns. Therefore, we propose a language that combines call-time choice and our plural semantics, which we have implemented in the Maude system. The resulting interpreter is then employed to develop and test several significant examples showing the capabilities of the combined semantics.

APA, Harvard, Vancouver, ISO, and other styles

22

CRUZ, FLAVIO, RICARDO ROCHA, SETH COPEN GOLDSTEIN, and FRANK PFENNING. "A Linear Logic Programming Language for Concurrent Programming over Graph Structures." Theory and Practice of Logic Programming 14, no. 4-5 (July 2014): 493–507. http://dx.doi.org/10.1017/s1471068414000167.

Full text

Abstract:

AbstractWe have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples.

APA, Harvard, Vancouver, ISO, and other styles

23

Ghica, Dan R. "Regular-Language Semantics for a Call-by-Value Programming Language." Electronic Notes in Theoretical Computer Science 45 (November 2001): 106–18. http://dx.doi.org/10.1016/s1571-0661(04)80958-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Zhang, Yudong, Wenhao Zheng, and Ming Li. "Learning Uniform Semantic Features for Natural Language and Programming Language Globally, Locally and Sequentially." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5845–52. http://dx.doi.org/10.1609/aaai.v33i01.33015845.

Full text

Abstract:

Semantic feature learning for natural language and programming language is a preliminary step in addressing many software mining tasks. Many existing methods leverage information in lexicon and syntax to learn features for textual data. However, such information is inadequate to represent the entire semantics in either text sentence or code snippet. This motivates us to propose a new approach to learn semantic features for both languages, through extracting three levels of information, namely global, local and sequential information, from textual data. For tasks involving both modalities, we project the data of both types into a uniform feature space so that the complementary knowledge in between can be utilized in their representation. In this paper, we build a novel and general-purpose feature learning framework called UniEmbed, to uniformly learn comprehensive semantic representation for both natural language and programming language. Experimental results on three real-world software mining tasks show that UniEmbed outperforms state-of-the-art models in feature learning and prove the capacity and effectiveness of our model.

APA, Harvard, Vancouver, ISO, and other styles

25

Tofte, Mads. "Principal signatures for higher-order program modules." Journal of Functional Programming 4, no. 3 (July 1994): 285–335. http://dx.doi.org/10.1017/s0956796800001088.

Full text

Abstract:

AbstractIn this paper we present a language for programming with higher-order modules. The language HML is based on Standard ML in that it provides structures, signatures and functors. In HML, functors can be declared inside structures and specified inside signatures; this is not possible in Standard ML. We present an operational semantics for the static semantics of HML signature expressions, with particular emphasis on the handling of sharing. As a justification for the semantics, we prove a theorem about the existence of principal signatures. This result is closely related to the existence of principal type schemes for functional programming languages with polymorphism.

APA, Harvard, Vancouver, ISO, and other styles

26

Kaiser, G. E. "Incremental dynamic semantics for language-based programming environments." ACM Transactions on Programming Languages and Systems 11, no. 2 (April 1989): 169–93. http://dx.doi.org/10.1145/63264.63400.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

COSTANTINÍ, STEFANIA, and GAETANO AURELIO LANZARONE. "A metalogic programming approach: language, semantics and applications." Journal of Experimental & Theoretical Artificial Intelligence 6, no. 3 (July 1994): 239–87. http://dx.doi.org/10.1080/09528139408953789.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Hudak, Paul. "Denotational semantics of a para-functional programming language." International Journal of Parallel Programming 15, no. 2 (April 1986): 103–25. http://dx.doi.org/10.1007/bf01414441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Berry, Gérard, and Georges Gonthier. "The Esterel synchronous programming language: design, semantics, implementation." Science of Computer Programming 19, no. 2 (November 1992): 87–152. http://dx.doi.org/10.1016/0167-6423(92)90005-v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Cruttwell, Geoffrey, Jonathan Gallagher, and Dorette Pronk. "Categorical semantics of a simple differential programming language." Electronic Proceedings in Theoretical Computer Science 333 (February 8, 2021): 289–310. http://dx.doi.org/10.4204/eptcs.333.20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

LASSEN, S. B. "Action semantics reasoning about functional programs." Mathematical Structures in Computer Science 7, no. 5 (October 1997): 557–89. http://dx.doi.org/10.1017/s0960129597002417.

Full text

Abstract:

This paper develops the functional part of a theory of action semantics for reasoning about programs. Action notation, the specification language of action semantics, is given an evaluation semantics, and operational techniques from process theory and functional programming are applied in the development of a versatile action theory. The power of the theory is demonstrated by means of action semantic proofs of functional program equivalences.

APA, Harvard, Vancouver, ISO, and other styles

32

Silbermann, Frank S. K., and Bharat Jayaraman. "A domain-theoretic approach to functional and logic programming." Journal of Functional Programming 2, no. 3 (July 1992): 273–321. http://dx.doi.org/10.1017/s095679680000040x.

Full text

Abstract:

AbstractThe integration of functional and logic programming languages has been a topic of great interest in the last decade. Many proposals have been made, yet none is completely satisfactory especially in the context of higher order functions and lazy evaluation. This paper addresses these shortcomings via a new approach: domain theory as a common basis for functional and logic programming. Our integrated language remains essentially within the functional paradigm. The logic programming capability is provided by set abstraction (via Zermelo-Frankel set notation), using the Herbrand universe as a set abstraction generator, but for efficiency reasons our proposed evaluation procedure treats this generator's enumeration parameter as a logical variable. The language is defined in terms of (computable) domain-theoretic constructions and primitives, using the lower (or angelic) powerdomain to model the set abstraction facility. The result is a simple, elegant and purely declarative language that successfully combines the most important features of both pure functional programming and pure Horn logic programming. Referential transparency with respect to the underlying mathematical model is maintained throughout. An implicitly correct operational semantics is obtained by direct execution of the denotational semantic definition, modified suitably to permit logical variables whenever the Herbrand universe is being generated within a set abstraction. Completeness of the operational semantics requires a form of parallel evaluation, rather than the more familiar left-most rule.

APA, Harvard, Vancouver, ISO, and other styles

33

BOUDOL, GÉRARD. "The recursive record semantics of objects revisited." Journal of Functional Programming 14, no. 3 (April 14, 2004): 263–315. http://dx.doi.org/10.1017/s0956796803004775.

Full text

Abstract:

In a call-by-value language, representing objects as recursive records requires using an unsafe fixpoint. We design, for a core language including extensible records, a type system which rules out unsafe recursion and still supports the construction of a principal type for each typable term. We illustrate the expressive power of this language with respect to object-oriented programming by introducing a sub-language for “mixin-based” programming.

APA, Harvard, Vancouver, ISO, and other styles

34

WEIRICH, STEPHANIE. "Type-safe run-time polytypic programming." Journal of Functional Programming 16, no. 6 (February 28, 2006): 681–710. http://dx.doi.org/10.1017/s0956796806005879.

Full text

Abstract:

Polytypic programming is a way of defining type-indexed operations, such as map, fold and zip, based on type information. Run-time polytypic programming allows that type information to be dynamically computed – this support is essential in modern programming languages that support separate compilation, first-class type abstraction, or polymorphic recursion. However, in previous work we defined run-time polytypic programming with a type-passing semantics. Although it is natural to define polytypic programs as operating over first-class types, such a semantics suffers from a number of drawbacks. This paper describes how to recast that work in a type-erasure semantics, where terms represent type information in a safe manner. The resulting language is simple and easy to implement – we present a prototype implementation of the necessary machinery as a small Haskell library.

APA, Harvard, Vancouver, ISO, and other styles

35

Vieira, R., A. F. Moreira, M. Wooldridge, and R. H. Bordini. "On the Formal Semantics of Speech-Act Based Communication in an Agent-Oriented Programming Language." Journal of Artificial Intelligence Research 29 (June 30, 2007): 221–67. http://dx.doi.org/10.1613/jair.2221.

Full text

Abstract:

Research on agent communication languages has typically taken the speech acts paradigm as its starting point. Despite their manifest attractions, speech-act models of communication have several serious disadvantages as a foundation for communication in artificial agent systems. In particular, it has proved to be extremely difficult to give a satisfactory semantics to speech-act based agent communication languages. In part, the problem is that speech-act semantics typically make reference to the "mental states" of agents (their beliefs, desires, and intentions), and there is in general no way to attribute such attitudes to arbitrary computational agents. In addition, agent programming languages have only had their semantics formalised for abstract, stand-alone versions, neglecting aspects such as communication primitives. With respect to communication, implemented agent programming languages have tended to be rather ad hoc. This paper addresses both of these problems, by giving semantics to speech-act based messages received by an AgentSpeak agent. AgentSpeak is a logic-based agent programming language which incorporates the main features of the PRS model of reactive planning systems. The paper builds upon a structural operational semantics to AgentSpeak that we developed in previous work. The main contributions of this paper are as follows: an extension of our earlier work on the theoretical foundations of AgentSpeak interpreters; a computationally grounded semantics for (the core) performatives used in speech-act based agent communication languages; and a well-defined extension of AgentSpeak that supports agent communication.

APA, Harvard, Vancouver, ISO, and other styles

36

LE, VAN HUNG, FEI LIU, and DINH KHANG TRAN. "Fuzzy linguistic logic programming and its applications." Theory and Practice of Logic Programming 9, no. 3 (May 2009): 309–41. http://dx.doi.org/10.1017/s1471068409003779.

Full text

Abstract:

AbstractThe paper introduces fuzzy linguistic logic programming, which is a combination of fuzzy logic programming, introduced by P. Vojtáš, and hedge algebras in order to facilitate the representation and reasoning on human knowledge expressed in natural languages. In fuzzy linguistic logic programming, truth values are linguistic ones, e.g., VeryTrue, VeryProbablyTrue and LittleFalse, taken from a hedge algebra of a linguistic truth variable, and linguistic hedges (modifiers) can be used as unary connectives in formulae. This is motivated by the fact that humans reason mostly in terms of linguistic terms rather than in terms of numbers, and linguistic hedges are often used in natural languages to express different levels of emphasis. The paper presents: (a) the language of fuzzy linguistic logic programming; (b) a declarative semantics in terms of Herbrand interpretations and models; (c) a procedural semantics which directly manipulates linguistic terms to compute a lower bound to the truth value of a query, and proves its soundness; (d) a fixpoint semantics of logic programs, and based on it, proves the completeness of the procedural semantics; (e) several applications of fuzzy linguistic logic programming; and (f) an idea of implementing a system to execute fuzzy linguistic logic programs.

APA, Harvard, Vancouver, ISO, and other styles

37

Lifschitz, Vladimir. "Answer Sets and the Language of Answer Set Programming." AI Magazine 37, no. 3 (October 7, 2016): 7–12. http://dx.doi.org/10.1609/aimag.v37i3.2670.

Full text

Abstract:

Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory article provides the mathematical background for the discussion of answer set programming in other contributions to this special issue.

APA, Harvard, Vancouver, ISO, and other styles

38

Cho, Kenta. "Semantics for a Quantum Programming Language by Operator Algebras." Electronic Proceedings in Theoretical Computer Science 172 (December 28, 2014): 165–90. http://dx.doi.org/10.4204/eptcs.172.12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

PLAICE, JOHN A. "The LUSTRE Synchronous Dataflow Programming Language: Design and Semantics." Annals of the New York Academy of Sciences 661, no. 1 Frontiers of (December 1992): 118–51. http://dx.doi.org/10.1111/j.1749-6632.1992.tb26038.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Cho, Kenta. "Semantics for a Quantum Programming Language by Operator Algebras." New Generation Computing 34, no. 1-2 (March 2016): 25–68. http://dx.doi.org/10.1007/s00354-016-0204-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Saint-Dizier, Patrick. "An approach to natural-language semantics in logic programming." Journal of Logic Programming 3, no. 4 (December 1986): 329–56. http://dx.doi.org/10.1016/0743-1066(86)90010-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Mihelic, Jurij, William Steingartner, and Valerie Novitzká. "A denotational semantics of a concatenative/compositional programming language." Acta Polytechnica Hungarica 18, no. 4 (2021): 231–50. http://dx.doi.org/10.12700/aph.18.4.2021.4.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

De Silva, Lavindra. "An Operational Semantics for True Concurrency in BDI Agent Systems." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (April 3, 2020): 7119–26. http://dx.doi.org/10.1609/aaai.v34i05.6199.

Full text

Abstract:

Agent programming languages have proved useful for formally modelling implemented systems such as PRS and JACK, and for reasoning about their behaviour. Over the past decades, many agent programming languages and extensions have been developed. A key feature in some of them is their support for the specification of ‘concurrent’ actions and programs. However, their notion of concurrency is still limited, as it amounts to a nondeterministic choice between (sequential) action interleavings. Thus, the notion does not represent ‘true concurrency’, which can more naturally exploit multi-core computers and multi-robot manufacturing cells. This paper provides a true concurrency operational semantics for a BDI agent programming language, allowing actions to overlap in execution. We prove key properties of the semantics, relating to true concurrency and to its link with interleaving.

APA, Harvard, Vancouver, ISO, and other styles

44

CLARK, DAVID, ROBERTO GIACOBAZZI, and CHUNYAN MU. "Foreword: programming language interference and dependence." Mathematical Structures in Computer Science 21, no. 6 (October 27, 2011): 1109–10. http://dx.doi.org/10.1017/s0960129511000168.

Full text

Abstract:

Interference and dependence are closely related concepts: interference being the observable phenomenon connected with dependence. Essentially, interference means that the behaviour of some parts of a dynamic system may influence the behaviour of other parts of the same system, while dependence specifies how the semantics of sub-components of a dynamic system are related. Identifying, measuring and controlling interference is essential in many aspects of modern computer science, in particular, in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. In all these fields, dependency and interference play a key role in designing suitable abstractions or in partitioning complex systems into simpler ones. Reasoning about dependency and interference requires theories, models and semantics, as well as algorithms and tools for their analysis. Beginning in 2004, the series of Programming Language Interference and Dependence (PLID) workshops has been devoted to promoting and spreading cutting-edge research in this field, with a particular emphasis on unpublished results with great impact on the theoretical basis. PLID2007, which was held at the The Technical University of Denmark on 21 August 2007, was particularly successful, and constituted the ideal forum for announcing a call for papers for a special journal issue on programming language interference and dependence, which would not necessarily be restricted to PLID2007 contributions. From the many expressions of interest, we selected six contributions by leading researchers in the field, some of which had been presented at the PLID2007 workshop. The selected papers focus on foundational aspects of dependency and interference, with applications in language-based security, data-base management systems and program slicing.

APA, Harvard, Vancouver, ISO, and other styles

45

Yang, Zheng, and Hang Lei. "Lolisa: Formal Syntax and Semantics for a Subset of the Solidity Programming Language in Mathematical Tool Coq." Mathematical Problems in Engineering 2020 (November 30, 2020): 1–15. http://dx.doi.org/10.1155/2020/6191537.

Full text

Abstract:

The security of blockchain smart contracts is one of the most emerging issues of the greatest interest for researchers. This article presents an intermediate specification language for the formal verification of Ethereum-based smart contract in Coq, denoted as Lolisa. The formal syntax and semantics of Lolisa contain a large subset of the Solidity programming language developed for the Ethereum blockchain platform. To enhance type safety, the formal syntax of Lolisa adopts a stronger static type system than Solidity. In addition, Lolisa includes a large subset of Solidity syntax components as well as general-purpose programming language features. Therefore, Solidity programs can be directly translated into Lolisa with line-by-line correspondence. Lolisa is inherently generalizable and can be extended to express other programming languages. Finally, the syntax and semantics of Lolisa have been encapsulated as an interpreter in mathematical tool Coq. Hence, smart contracts written in Lolisa can be symbolically executed and verified in Coq.

APA, Harvard, Vancouver, ISO, and other styles

46

Bryant, Barrett, Jeff Gray, Marjan Mernik, Peter Clarke, Robert France, and Gabor Karsai. "Challenges and directions in formalizing the semantics of modeling languages." Computer Science and Information Systems 8, no. 2 (2011): 225–53. http://dx.doi.org/10.2298/csis110114012b.

Full text

Abstract:

Developing software from models is a growing practice and there exist many model-based tools (e.g., editors, interpreters, debuggers, and simulators) for supporting model-driven engineering. Even though these tools facilitate the automation of software engineering tasks and activities, such tools are typically engineered manually. However, many of these tools have a common semantic foundation centered around an underlying modeling language, which would make it possible to automate their development if the modeling language specification were formalized. Even though there has been much work in formalizing programming languages, with many successful tools constructed using such formalisms, there has been little work in formalizing modeling languages for the purpose of automation. This paper discusses possible semantics-based approaches for the formalization of modeling languages and describes how this formalism may be used to automate the construction of modeling tools.

APA, Harvard, Vancouver, ISO, and other styles

47

MAY, WOLFGANG. "XPath-logic and XPathLog: A logic-programming style XML data manipulation language." Theory and Practice of Logic Programming 4, no. 3 (April 16, 2004): 239–87. http://dx.doi.org/10.1017/s147106840300187x.

Full text

Abstract:

We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a clear, declarative language for querying and manipulating XML whose perspectives are especially in XML data integration. In our characterization, the formal semantics is defined wrt. an edge-labeled graph-based model, which covers the XML data model. We give a complete, logic-based characterization of XML data and the main language concept for XML, XPath. XPath-Logic extends the XPath language with variable bindings and embeds it into first-order logic. XPathLog is then the Horn fragment of XPath-Logic, providing a Datalog-style, rule-based language for querying and manipulating XML data. The model-theoretic semantics of XPath-Logic serves as the base of XPathLog as a logic-programming language, whereas also an equivalent answer-set semantics for evaluating XPathLog queries is given. In contrast to other approaches, the XPath syntax and semantics is also used for a declarative specification how the database should be updated: when used in rule heads, XPath filters are interpreted as specifications of elements and properties which should be added to the database.

APA, Harvard, Vancouver, ISO, and other styles

48

NISHIMURA, SUSUMU, and ATSUSHI OHORI. "Parallel functional programming on recursively defined data via data-parallel recursion." Journal of Functional Programming 9, no. 4 (July 1999): 427–62. http://dx.doi.org/10.1017/s0956796899003457.

Full text

Abstract:

This article proposes a new language mechanism for data-parallel processing of dynamically allocated recursively defined data. Different from the conventional array-based data- parallelism, it allows parallel processing of general recursively defined data such as lists or trees in a functional way. This is achieved by representing a recursively defined datum as a system of equations, and defining new language constructs for parallel transformation of a system of equations. By integrating them with a higher-order functional language, we obtain a functional programming language suitable for describing data-parallel algorithms on recursively defined data in a declarative way. The language has an ML style polymorphic type system and a type sound operational semantics that uniformly integrates the parallel evaluation mechanism with the semantics of a typed functional language. We also show the intended parallel execution model behind the formal semantics, assuming an idealized distributed memory multicomputer.

APA, Harvard, Vancouver, ISO, and other styles

49

Seidman, Robert H. "Computer Programming and Logical Reasoning: Unintended Cognitive Effects." Journal of Educational Technology Systems 18, no. 2 (December 1989): 123–41. http://dx.doi.org/10.2190/myuy-g56t-226t-pvt0.

Full text

Abstract:

Recent research results having to do with explicit instruction in computer programming and cognitive skills indicate an increased emphasis upon the structure of the learning environment surrounding programming languages. A new research direction concerned with transfer effects due to environmental aspects of programming instruction is emerging. A conceptual analysis of the syntax and semantics of the IF-THEN [ELSE] conditional command is presented which suggests that mastering a procedural language itself (independent of environment) might have unintended, indirect, and potentially negative effects upon fundamental intellectual skills. Research is reported which suggests that there are unintended side-effects upon childrens' conditional reasoning ability due to learning a procedural computer programming language.

APA, Harvard, Vancouver, ISO, and other styles

50

El-Zawawy, Mohamed A. "Testing Automation of Context-Oriented Programs Using Separation Logic." Applied Computational Intelligence and Soft Computing 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/930186.

Full text

Abstract:

A new approach for programming that enables switching among contexts of commands during program execution is context-oriented programming (COP). This technique is more structured and modular than object-oriented and aspect-oriented programming and hence more flexible. For context-oriented programming, as implemented in COP languages such as ContextJ*and ContextL, this paper introduces accurate operational semantics. The language model of this paper uses Java concepts and is equipped with layer techniques for activation/deactivation of layer contexts. This paper also presents a logical system for COP programs. This logic is necessary for the automation of testing, developing, and validating of partial correctness specifications for COP programs and is an extension of separation logic. A mathematical soundness proof for the logical system against the proposed operational semantics is presented in the paper.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Programming language semantics'

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