Sciweavers

900 search results - page 7 / 180
» Pure Type Systems Formalized
Sort
View
ENTCS
2006
161views more  ENTCS 2006»
13 years 7 months ago
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...
Hartmut Ehrig, Karsten Ehrig
KBSE
2008
IEEE
14 years 1 months ago
Type-Checking Software Product Lines - A Formal Approach
—A software product line (SPL) is an efficient means to generate a family of program variants for a domain from a single code base. However, because of the potentially high numb...
Christian Kästner, Sven Apel
FINTAL
2006
13 years 11 months ago
Coordination Structures in a Typed Feature Structure Grammar: Formalization and Implementation
Abstract. Every language employs its own coordination strategies, according to the type of coordinating marking, the pattern of marking, the position of the marker, and the phrase ...
Jong-Bok Kim, Jaehyung Yang
CSFW
2005
IEEE
14 years 1 months ago
Achieving Information Flow Security through Precise Control of Effects
This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This ap...
William L. Harrison, James Hook
ENTCS
2002
129views more  ENTCS 2002»
13 years 7 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi