Sciweavers

852 search results - page 121 / 171
» entcs 2010
Sort
View
135
Voted
ENTCS
2006
113views more  ENTCS 2006»
15 years 14 days ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
103
Voted
ENTCS
2006
135views more  ENTCS 2006»
15 years 14 days ago
Formal Semantics and Analysis of Component Connectors in Reo
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...
Mohammad Reza Mousavi, Marjan Sirjani, Farhad Arba...
90
Voted
ENTCS
2006
116views more  ENTCS 2006»
15 years 14 days ago
Stepwise Refinement of Processes
Industry is looking to create a market in reliable "plug-and-play" components. To model components in a modular style it would be useful to combine event-based and state...
Steve Reeves, David Streader
ENTCS
2006
184views more  ENTCS 2006»
15 years 14 days ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
102
Voted
ENTCS
2007
113views more  ENTCS 2007»
15 years 12 days ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi