On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990

First Page		Document Content
Date: 2014-04-01 05:47:01 Theoretical computer science Mathematics Programming language theory Logic in computer science Mathematical logic Asymptotic analysis Logic programming Type theory Unification Rewriting Rewrite order Term		On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990 Add to Reading List Source URL: folk.uio.no Download Document from Source Website File Size: 245,17 KB Share Document on Facebook

	Electroporation of a multicellular system: asymptotic model analysis DocID: 1v7Rz - View Document
	Introduction Generic Decoding Algorithms Asymptotic Analysis over the field size Results Asymptotic Analysis of ISD algorithms for DocID: 1uPFK - View Document
	1 Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks Jinbei Zhang, Luoyi Fu, Xinbing Wang Dept. of Electronic Engineering DocID: 1uJZE - View Document
	Finite-Length and Asymptotic Analysis and Design of LDPC Codes for Binary Erasure and Fading Channels by DocID: 1uzE2 - View Document
	COMMUNICATION Some Open Problems in Asymptotic Geometric Analysis Bo’az Klartag and Elisabeth Werner Communicated by Christina Sormani DocID: 1utGW - View Document