Sciweavers

844 search results - page 30 / 169
» More On Implicit Syntax
Sort
View
ICFP
2003
ACM
15 years 2 months ago
Reasoning about recursive procedures with parameters
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
Ralph-Johan Back, Viorel Preoteasa
HICSS
2007
IEEE
94views Biometrics» more  HICSS 2007»
15 years 3 months ago
Towards Model Transformation Generation By-Example
— With the advent of Model-Driven Engineering (MDE) several model transformation approaches and languages have been developed in the last 5 years. Most of these existing approach...
Manuel Wimmer, Michael Strommer, Horst Kargl, Gerh...
HASKELL
2007
ACM
15 years 1 months ago
Why it's nice to be quoted: quasiquoting for haskell
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
Geoffrey Mainland
ENTCS
2006
144views more  ENTCS 2006»
14 years 9 months ago
Infinitary Howe's Method
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
Paul Blain Levy
ICASSP
2011
IEEE
14 years 1 months ago
Automatic minute generation for parliamentary speech using conditional random fields
We show a novel approach of automatically generating minutes style extractive summaries for parliamentary speech. Minutes are structured summaries consisting of sequences of busin...
Justin Jian Zhang, Pascale Fung, Ricky Ho Yin Chan