Sciweavers

1027 search results - page 105 / 206
» Language Support for Connector Abstractions
Sort
View
LISP
2008
105views more  LISP 2008»
13 years 9 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
PADL
2009
Springer
14 years 9 months ago
Recycle Your Arrays!
Abstract. Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforest...
Roman Leshchinskiy
ICFP
2003
ACM
14 years 9 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
ESOP
2010
Springer
14 years 6 months ago
A Grammar-based Approach to Invertible Programs
Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by man...
Kazutaka Matsuda, Shin-Cheng Mu, Zhenjiang Hu and ...
SEMWEB
2009
Springer
14 years 3 months ago
Change Representation For OWL 2 Ontologies
Ontologies are entities that evolve over time, therefore it is essential to represent and manage changes to ontologies along with the ontologies themselves. In this paper we propos...
Raúl Palma, Peter Haase, Óscar Corch...