Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

111

Voted

JFLP
2002

84views more JFLP 2002»

Subject Reduction of Logic Programs as Proof-Theoretic Property

15 years 2 months ago

Subject Reduction of Logic Programs as Proof-Theoretic Property

Download scholar.lib.vt.edu

We consider prescriptive type systems for logic programs (as in G

Pierre Deransart, Jan-Georg Smaus

Real-time Traffic

JFLP 2002 | Logic Programs | Operational Property | Prescriptive Type Systems |

claim paper

Related Content

» Proof Theory Transformations and Logic Programming for Debugging Security Protocols

» Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

» Strictness Logic and Polymorphic Invariance

» Eliminating Proofs from Programs

» ProofDirected Decompilation of LowLevel Code

» A quantitative study of reductions in algebraic libraries

» Light types for polynomial time computation in lambdacalculus

» Proving acceptability properties of relaxed nondeterministic approximate programs

» Property models from incidental algorithms to reusable components

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JFLP
Authors	Pierre Deransart, Jan-Georg Smaus

Comments (0)