Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,531 papers for “static semantics”

Static Semantics with Montages

Sabine Glesner, Andreas Heberle, Welf Löwe · 1998

We introduce a descriptive approach to define static semantics in the framework of Montages. It preserves readability and convenience of specification and guarantees efficient computation of the typing.

Cited by 0

Static Semantics for Modules

The MIT Press eBooks · 1997

This chapter contains sections titled: Semantic Objects, Type Realisation, Signature Instantiation, Functor Signature Instantiation, Enrichment, Signature Matching, Inference Rules

Cited by 0

A static semantics for Haskell

Simon Peyton, Philip Wadler · 1992

This paper gives a static semantics for a large subset of Haskell, including giving a translation into a language without overloading. It is our intention to cover the complete language in due course. One innovative aspect is the use of ideas from the second-order lambda calculus to record type information in the program. Contents 1 Introduction 4 2 A sketch of how overloading is resolved 6 3 Notation 7 4 Abstract syntax 13 5 Programs 19 6 Type declarations 21 7 Class declarations 24 8 Instance declarations 26 9 Value declarations 28 10 Expressions 37 11 Pattern matching 40 12 Dictionary manipulation 45 13 Implementation notes 47 14 References 47 List of Figures 1 Syntax of semantic types : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 10 2 Environments : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 3 Abstract syntax for Haskell: declarations and bindings : : : : : : : : : : : : : 14 4 Abstract syntax of Haskell: patterns and expressions : : ...

Cited by 0

ECMA-335 static formal semantics

V. А. Vasenin, M. A. Krivchikov · Programming and Computer Software · 2012

One of the efficient approaches to creating trusted software consists in the construction of a formal model that reflects its semantics and subsequent code verification with the use of this model. This work presents results of studies aimed at constructing a general model for description of static formal semantics of programs represented as a high-level intermediate code conforming to the ECMA-335 standard.

Cited by 0

Static analysis for skeletal semantics

Vincent Rébiscoul · theses.fr (ABES) · 2024

Avant de rentrer dans le vif du sujet, je tiens remercier tous ceux qui m'ont aid de prs ou de loin durant ces trois annes de thse.Je suis particulirement reconnaissant envers Thomas et Alan, qui m'ont rigoureusement encadr.Vous avez toujours t disponible, et chacun m'a apport son expertise.Alan, tu m'as normment aid comprendre les smantiques squelettiques.Ton expertise technique m'a bien souvent permis d'avancer.Thomas, tu m'as rappel (plusieurs fois) que la recherche se plaait dans un contexte, et que l'on devait se comparer, s'inspirer, et se diffrencier du travail ralis par d'autres.Aussi, vous avez t trs comprhensif lors de moments difficiles.Je salue aussi l'ensemble de l'quipe picure.Les discussions autour d'un caf et les sminaires d'quipe ont t de trs bons moments partager.Cela a grandement particip mon envie de venir au laboratoire tous les jours, et au plaisir que j'ai pris travailler.Je remercie les collgues du bureau F213 avec qui j'ai beaucoup ri (et qui m'ont parfois distrait de mon travail).Pierre, merci d'avoir mi disposition ton appartement pour les soires rugby ou dgustation de gin.Victoire, merci pour tes analyses socitales et ton aide sur les smantiques squelettiques.Merci Sarah de m'avoir accueilli dans sa colocation, tu es toujours disponible et prte aider.Merci Tho et Jean-Loup, dont le bureau a t un refuge quand les journes devenaient longues.Merci Lucas et Calvin d'tre venu Rennes quand j'en ai eu grandement besoin.Merci toute ma fratrie : Nathan et Flora de s'tre dplacs pour ma soutenance, Xavier d'avoir t un soutien moral pendant une anne complique, Laurence d'avoir partag ma douleur lorsque l'on devait chacun rdiger un manuscrit.Je remercie ma mre, Chantal, pour avoir prpar un excellent pot de thse.Merci a Nadja pour tes pastillas.Je ddie cette thse mon pre, qui aurait probablement t trs fier (et un peu jaloux).

Cited by 0Open access

Static semantics for syntax objects

David Fisher · 2010

Designing custom notations is essential to designing advanced systems. Although an electrical engineer could write an English description of a circuit board, explaining which components were used and how each was connected, it is not very effective for him to do so; he would do much better to draw a circuit diagram. This not only streamlines the process of circuit architecture, allowing commonly-used design idioms to be expressed concisely, but it also allows a reasoning engine, such as an automated design tool or the electrical engineer himself, to reason about the circuit, identifying redundancies, determine its behavior and find potential problem points.

Cited by 3Open access

Static semantics for syntax objects

Fisher, David · Digital Repository Service (Northeastern University)

Designing custom notations is essential to designing advanced systems. Although an electrical engineer could write an English description of a circuit board, explaining which components were used and how each was connected, it is not very effective for him to do so; he would do much better to draw a circuit diagram. This not only streamlines the process of circuit architecture, allowing commonly-used design idioms to be expressed concisely, but it also allows a reasoning engine, such as an automated design tool or the electrical engineer himself, to reason about the circuit, identifying redundancies, determine its behavior and find potential problem points.

Cited by 0

Executable specification of static semantics

Despeyroux, Thierry, Institut National de Recherche en Informatique et en Automatique, Centre Sophia Antipolis Valbonne (FRANCE) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1984

Résumé disponible sur le PDF

Cited by 2Open access

A static semantics for Haskell

Karl‐Filip Faxén · Journal of Functional Programming · 2002

This paper gives a static semantics for Haskell 98, a non-strict purely functional programming language. The semantics formally specifies nearly all the details of the Haskell 98 type system, including the resolution of overloading, kind inference (including defaulting) and polymorphic recursion, the only major omission being a proper treatment of ambiguous overloading and its resolution. Overloading is translated into explicit dictionary passing, as in all current implementations of Haskell. The target language of this translation is a variant of the Girard–Reynolds polymorphic lambda calculus featuring higher order polymorphism and explicit type abstraction and application in the term language. Translated programs can thus still be type checked, although the implicit version of this system is impredicative. A surprising result of this formalization effort is that the monomorphism restriction, when rendered in a system of inference rules, compromises the principal type property.

Cited by 35Open access

Unifying static and dynamic denotational semantics

Pierre Boudes · 2008

Abstract. This work deals with semantics of programming languages (or equivalently, thanks to Curry-Howard isomorphism, with semantics of proofs). We introduce a framework in which both static semantics (Ehrhard’s hypercoherences) and dynamic semantics (Hyland-Ong’s games), can be presented. The work is carried in a multiplicative subsystem of Laurent’s polarized linear logic with weakening. Like Böhm trees for lambda-calculus, designs, adapted from Girard’s ludics, play the role of intermediate objets between the syntax and the (two) semantics. Our framework allows us to define a new coherence semantics and to prove its full completeness. 1

Cited by 0

Static semantics of message sequence charts

Michel Reniers · Data Archiving and Networked Services (DANS) · 1996

The purpose of this document is to formally define the syntax requirements of Message Sequence Charts. The description of the syntax requirements as presented in Recommendation Z.120 [IT93] is open to ambiguous interpretation and should therefore be reconsidered. A new set of syntax requirements is formulated and their formalization is presented. This formalization is based on

Cited by 4Open access

Semantics of flavors with static binding

Krause, M., Simon, F., Kiel Univ. (Germany). Inst. fuer Informatik und Praktische Mathematik · OpenGrey (Institut de l'Information Scientifique et Technique) · 1987

Cited by 0

Towards Improving the Static Semantics of XCore

Vladiela Petraşcu, Dan Chiorean · SHILAP Revista de lepidopterología · 2010

Throughout this paper, we analyse the state of facts concerning the static semantics of the XCore meta-metamodel and we propose improvements in formalizing it.

Cited by 2Open access