000226194 001__ 226194
000226194 005__ 20190118053648.0
000226194 037__ $$aREP_WORK
000226194 245__ $$aA TASTY Alternative
000226194 269__ $$a2016
000226194 260__ $$c2016
000226194 336__ $$aReports
000226194 520__ $$aThis document proposes a new serialization format for typed syntax trees of Scala programs. It aims to be ● compact: All numbers and references are length encoded, trees are inlined by default but may be shared. ● lazy: Trees can be explored from the top, and one can suspend reading subtrees at any time. The only section that needs to be scanned in full is the name table. Laziness is important for the compiler frontend as most of the information in a TASTY file is not needed then. ● extensible: New sections can be defined at will. Additional elements always carry their length, so can be safely skipped in older readers. ● precise: The format given here is in essence a serialized abstract syntax tree for typed Scala. Some of the main classifications,e.g. between types, terms and paths are reflected in the grammar. Picklers and unpicklers for the format have been implemented in https://github.com/lampepfl/dotty/pull/394. The present document gives a syntax summary of the format. More explanations are found in the TASTY reference manual.
000226194 700__ $$0241835$$aOdersky, Martin$$g126003
000226194 700__ $$0246182$$aBurmako, Eugene$$g214505
000226194 700__ $$0248093$$aPetrashko, Dmytro$$g233192
000226194 8564_ $$uhttps://docs.google.com/document/d/1Wp86JKpRxyWTqUU39H40ZdXOlacTNs20aTj7anZLQDw/view$$zURL
000226194 8564_ $$s118940$$uhttps://infoscience.epfl.ch/record/226194/files/ATASTYAlternative.pdf$$yn/a$$zn/a
000226194 909C0 $$0252187$$pLAMP$$xU10409
000226194 909CO $$ooai:infoscience.tind.io:226194$$pIC$$pGLOBAL_SET$$preport
000226194 917Z8 $$x233192
000226194 937__ $$aEPFL-REPORT-226194
000226194 973__ $$aEPFL
000226194 980__ $$aREPORT