000			01423nam a2200265 a 4500
001			vtls000072251
003			KUKTEM
005			20251125095405.0
008			130618t2012 enk f 001 0 eng d
020			_a9780521879408 (hardback)
039		9	_a201401221058 _bsaini _y201306181604 _zsri
040			_aUMP
090			_aQA76.63 .M55 2012
100	1		_aMiller, Dale
245	1	0	_aProgramming with higher-order logic / _cDale Miller, Gopalan Nadathur
260			_aCambridge : _bCambridge University Press, _c2012
300			_axiii, 306 p. ; _c24 cm.
504			_aIncludes bibliographical references and index
505	0		_aMachine generated contents note: 1. First-order terms and representations of data; 2. First-order horn clauses; 3. First-order hereditary Harrop formulas; 4. Typed lambda-terms and formulas; 5. Using quantification at higher-order types; 6. Mechanisms for structuring large programs; 7. Computations over [lambda]-terms; 8. Unification of [lambda]-terms; 9. Implementing proof systems; 10. Computations over functional programs; 11. Encoding a process calculus language; Appendix. The Teyjus system
650		0	_aLogic programming
650		0	_aProlog (Computer program language)
650		7	_aCOMPUTERS / Programming Languages / General. _2bisacsh
700	1		_aNadathur, Gopalan
999			_aVIRTUA40 _c70893 _d70899
999			_aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5040*5050*6500*6501*6502*7000*9992